4 citations · 12 across the 10 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Dynamic coloring parameters for graphs with given genus
Sarah Loeb, Thomas Mahoney, Benjamin Reiniger +1
A proper vertex coloring of a graph is -dynamic if for each , at least colors appear in . In this paper we investigate -dynamic versio…
math.CO2015
I,F-partitions of Sparse Graphs
Axel Brandt, Michael Ferrara, Mohit Kumbhat +3
A star -coloring is a proper -coloring where the union of two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-c…
math.CO2015★ 1 cited
Asymptotically optimal neighbor sum distinguishing total colorings of graphs
Sarah Loeb, Jakub Przybyło, Yunfang Tang
Given a proper total -coloring of a graph , we define the value of a vertex to be . The smallest int…