3-consecutive C-colorings of graphs
From MaRDI portal
Publication:2997600
DOI10.7151/DMGT.1502zbMATH Open1217.05087OpenAlexW1971771192MaRDI QIDQ2997600FDOQ2997600
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
Recommendations
- 3-consecutive vertex coloring of a graph
- 3-consecutive edge coloring of a graph
- Vertex-colouring of 3-chromatic circulant graphs
- Coloring of pseudocubic graphs in three colors
- On 3-hued coloring of graphs
- On proper total colorings of graphs with three constraints
- Consecutive colorings of graphs
- Conjectures on uniquely 3-edge-colorable graphs
- Third case of the cyclic coloring conjecture
- Third case of the cyclic coloring conjecture
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cited In (16)
- Worm colorings
- Improved bounds for some facially constrained colorings
- Title not available (Why is that?)
- 3-consecutive edge coloring of a graph
- ℱ-WORM colorings of some 2-trees: partition vectors
- Neighborhood-restricted \([\leq 2]\)-achromatic colorings
- Vertex colorings without rainbow subgraphs
- Vertex coloring without large polychromatic stars
- \(F\)-WORM colorings: results for 2-connected graphs
- Maximum number of colors: C-coloring and related problems
- 3-Sequent achromatic sum of graphs
- Coloring subgraphs with restricted amounts of hues
- Title not available (Why is that?)
- Consecutive colorings of graphs
- WORM colorings of planar graphs
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
This page was built for publication: 3-consecutive C-colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997600)
