Joint extension of two theorems of Kotzig on 3-polytopes
From MaRDI portal
Publication:2367448
DOI10.1007/BF01202794zbMath0777.05050OpenAlexW2044164675MaRDI QIDQ2367448
Publication date: 16 August 1993
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202794
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (21)
All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ Paths with restricted degrees of their vertices in planar graphs ⋮ Weight of edges in normal plane maps ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ Light 3-stars in sparse plane graphs ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ An extension of Kotzig's theorem ⋮ Refined weight of edges in normal plane maps ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps ⋮ On doubly light triangles in plane graphs ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Describing 3-paths in normal plane maps ⋮ Weight of 3-paths in sparse plane graphs ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Deeply asymmetric planar graphs ⋮ All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 ⋮ Describing tight descriptions of 3-paths in triangle-free normal plane maps ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps
Cites Work
This page was built for publication: Joint extension of two theorems of Kotzig on 3-polytopes
