Discussiones Mathematicae Graph Theory · 2010 · 18 citations · 6 references
Natural SciencesMathematicsColor TheoryCombinatoricsComputational GeometryGraph ColoringGraph TheoryColoring Theorems
A 3-consecutive C-coloring of a graph G = (V;E) is a mapping ’ : V !N such that every path on three vertices has at most two colors. We prove general estimates on the maximum number „ ´3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with „ ´3CC(G) ‚ k for k = 3 and k = 4.
6
Vitaly Voloshin · 1993 · 82 citations · Full text
Jenő Lehel, Zs. Tuza · Discrete Mathematics · 1986 · 53 citations
Color-bounded hypergraphs, I: General results
Csilla Bujtás, Źsolt Tuza · Discrete Mathematics · 2008 · 25 citations