Joint extension of two theorems of Kotzig on 3-polytopes

DOI10.1007/BF01202794zbMath0777.05050MaRDI QIDQ2367448

Oleg V. Borodin

Publication date: 16 August 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

bounds; planar map; Euler formula; polytoppe

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Paths with restricted degrees of their vertices in planar graphs, Tight Descriptions of 3‐Paths in Normal Plane Maps, Weight of edges in normal plane maps, An extension of Kotzig's theorem, Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps, On doubly light triangles in plane graphs, Describing 3-paths in normal plane maps, Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27, Weight of 3-paths in sparse plane graphs, Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices, Lightness of digraphs in surfaces and directed game chromatic number, Describing tight descriptions of 3-paths in triangle-free normal plane maps, Low 5-stars in normal plane maps with minimum degree 5, Refined weight of edges in normal plane maps, Deeply asymmetric planar graphs

Cites Work

• A seven-color theorem on the sphere
• On the total coloring of planar graphs.
• Unnamed Item