3-consecutive C-colorings of graphs
From MaRDI portal
Publication:2997600
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
Cited in
(18)- scientific article; zbMATH DE number 7523847 (Why is no real title available?)
- ℱ-WORM colorings of some 2-trees: partition vectors
- \(F\)-WORM colorings: results for 2-connected graphs
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
- 3-consecutive edge coloring of a graph
- Vertex colorings without rainbow subgraphs
- scientific article; zbMATH DE number 4158671 (Why is no real title available?)
- 3-consecutive vertex coloring of a graph
- Maximum number of colors: C-coloring and related problems
- Worm colorings
- Improved bounds for some facially constrained colorings
- Coloring subgraphs with restricted amounts of hues
- WORM colorings of planar graphs
- Consecutive colorings of graphs
- Neighborhood-restricted \([\leq 2]\)-achromatic colorings
- Vertex coloring without large polychromatic stars
- 3-sequent achromatic sum of graphs
- When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
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)
