Cyclic degrees of 3-polytopes
From MaRDI portal
Publication:1808711
DOI10.1007/s003730050060zbMath0930.05055OpenAlexW2003216770MaRDI QIDQ1808711
Douglas R. Woodall, Oleg V. Borodin
Publication date: 30 January 2000
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730050060
3-polytopecyclic chromatic number3-connected plane graphface degreecyclic degreetruncated dodecahedron
Extremal problems in graph theory (05C35) Polyhedra and polytopes; regular figures, division of spaces (51M20) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
The height of faces of 3-polytopes, The weight of faces in normal plane maps, Heights of minor faces in 3-polytopes, Describing 3-faces in normal plane maps with minimum degree 4, Describing faces in plane triangulations, The vertex-face weight of edges in 3-polytopes, More about the height of faces in 3-polytopes, Weight of faces in plane maps, An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations, On the weight of minor faces in triangle-free 3-polytopes, Heights of minor faces in triangle-free 3-polytopes, Low edges in 3-polytopes, Low minor faces in 3-polytopes, A general upper bound for the cyclic chromatic number of 3‐connected plane graphs, Low faces of restricted degree in 3-polytopes
