3-consecutive C-colorings of graphs

DOI10.7151/dmgt.1502zbMath1217.05087OpenAlexW1971771192MaRDI QIDQ2997600

E. Sampathkumar, Charles Dominic, Csilla Bujtás, Zsolt Tuza, M. S. Subramanya

Publication date: 9 May 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7f7bed2907a41d92659b776cb3169130715a8a84

zbMATH Keywords

graph coloringvertex coloringconsecutive coloringupper chromatic number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Neighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ Vertex colorings without rainbow subgraphs ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ Coloring subgraphs with restricted amounts of hues ⋮ Maximum number of colors: C-coloring and related problems ⋮ Vertex coloring without large polychromatic stars ⋮ 3-consecutive edge coloring of a graph ⋮ WORM colorings of planar graphs ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ Worm colorings ⋮ ℱ-WORM colorings of some 2-trees: partition vectors ⋮ 3-Sequent achromatic sum of graphs ⋮ Improved bounds for some facially constrained colorings

This page was built for publication: 3-consecutive C-colorings of graphs