53 citations · 217 across the 33 of their papers we have counts for
Showing 2013 · math.COShow all
3 papers · 2 filters
math.CO2013
Total weight choosability in Hypergraphs
Florian Pfender
A total weighting of the vertices and edges of a hypergraph is called vertex-coloring if the total weights of the vertices yield a proper coloring of the graph, i.e., every edge co…
math.CO2013★ 3 cited
The 1-2-3 Conjecture for Hypergraphs
Maciej Kalkowski, Michał Karoński, Florian Pfender
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least…
math.CO2013
Quartic graphs with every edge in a triangle
Florian Pfender, Gordon F. Royle
We characterise the quartic (i.e. 4-regular) multigraphs with the property that every edge lies in a triangle. The main result is that such graphs are either squares of cycles, lin…