Recommendations
- Cyclic chromatic number of 3-connected plane graphs
- Cyclic degree and cyclic coloring of 3-polytopes
- A general upper bound for the cyclic chromatic number of 3-connected plane graphs
- On vertex types and cyclic colourings of 3-connected plane graphs
- scientific article; zbMATH DE number 1275149
- Cyclic colorings of 3-polytopes with large maximum face size
- A note on cyclic chromatic number
- Lower bound on the maximum number of contractible edges on longest cycles of a 3-connected graph
- Another step towards proving a conjecture by Plummer and Toft
- Cyclic coloring of plane graphs with maximum face size 16 and 17
Cited in
(44)- Coloring the faces of convex polyhedra so that like colors are far apart
- Contractible subgraphs of quasi 5-connected graphs
- Low minor faces in 3-polytopes
- A survey on the cyclic coloring and its relaxations
- Minimal locally cyclic triangulations of the projective plane
- Low edges in 3-polytopes
- Cyclic degree and cyclic coloring of 3-polytopes
- Splitting and contractible edges in 4-connected graphs
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
- On maximal cycles or triangular planar polygonal graphs and their coloring
- Parity vertex colouring of plane graphs
- Heights of minor faces in 3-polytopes
- Cyclic coloring of plane graphs with maximum face size 16 and 17
- Cyclic colorings of 3-polytopes with large maximum face size
- The vertex-face weight of edges in 3-polytopes
- Facial rainbow edge-coloring of plane graphs
- On the \(d\)-distance face chromatic number of plane graphs
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- On the weight of minor faces in triangle-free 3-polytopes
- Facially-constrained colorings of plane graphs: a survey
- The 3‐connected graphs with a maximum matching containing precisely one contractible edge
- Third case of the cyclic coloring conjecture
- Facial rainbow coloring of plane graphs
- Cycles of length 0 modulo 4 in graphs
- On the cyclic coloring conjecture
- Third case of the cyclic coloring conjecture
- Facial colorings using Hall's theorem
- Another step towards proving a conjecture by Plummer and Toft
- Cyclic coloring of plane graphs
- On cyclic colorings and their generalizations
- The removable edges and the contractible subgraphs of 5-connected graphs
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs
- Heights of minor faces in triangle-free 3-polytopes
- How to contract an essentially 6-connected graph to a 5-connected graph
- Cyclic, diagonal and facial colorings
- Cyclic colorings of plane graphs with independent faces
- A general upper bound for the cyclic chromatic number of 3-connected plane graphs
- WELL-COVERED GRAPHS: A SURVEY
- Extending matchings in graphs: A survey
- A catalog of facially complete graphs
- Reduction for 3-connected graphs of minimum degree at least four
- Coloring plane graphs with independent crossings
- Non-contractible edges in a 3-connected graph
This page was built for publication: Cyclic coloration of 3-polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801577)
