Cyclic coloration of 3-polytopes

DOI10.1002/jgt.3190110407zbMath0655.05030OpenAlexW2161045079MaRDI QIDQ3801577

Michael D. Plummer, Bjarne Toft

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110407

zbMATH Keywords

planar graphs3-polytopescontractible linescyclic colorationcyclic coloration number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (39)

Reduction for 3-connected graphs of minimum degree at least four ⋮ Third case of the cyclic coloring conjecture ⋮ Minimal locally cyclic triangulations of the projective plane ⋮ The 3‐connected graphs with a maximum matching containing precisely one contractible edge ⋮ On the \(d\)-distance face chromatic number of plane graphs ⋮ Non-contractible edges in a 3-connected graph ⋮ Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ WELL-COVERED GRAPHS: A SURVEY ⋮ How to contract an essentially 6-connected graph to a 5-connected graph ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Heights of minor faces in 3-polytopes ⋮ Cyclic coloring of plane graphs with maximum face size 16 and 17 ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Describing 3-faces in normal plane maps with minimum degree 4 ⋮ Describing faces in plane triangulations ⋮ Splitting and contractible edges in 4-connected graphs ⋮ Parity vertex colouring of plane graphs ⋮ The vertex-face weight of edges in 3-polytopes ⋮ On the cyclic coloring conjecture ⋮ A survey on the cyclic coloring and its relaxations ⋮ Cyclic colorings of plane graphs with independent faces ⋮ The removable edges and the contractible subgraphs of 5-connected graphs ⋮ Cyclic coloring of plane graphs ⋮ Another step towards proving a conjecture by Plummer and Toft ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ Facial colorings using Hall's theorem ⋮ Cyclic, diagonal and facial colorings ⋮ Coloring plane graphs with independent crossings ⋮ On the weight of minor faces in triangle-free 3-polytopes ⋮ Third Case of the Cyclic Coloring Conjecture ⋮ Heights of minor faces in triangle-free 3-polytopes ⋮ Low edges in 3-polytopes ⋮ Low minor faces in 3-polytopes ⋮ Facial rainbow coloring of plane graphs ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ On cyclic colorings and their generalizations ⋮ Coloring the faces of convex polyhedra so that like colors are far apart ⋮ Cycles of length 0 modulo 4 in graphs ⋮ Extending matchings in graphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclic coloration of 3-polytopes