Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
From MaRDI portal
Publication:727044
zbMath1351.05058MaRDI QIDQ727044
Anna O. Ivanova, Oleg V. Borodin
Publication date: 6 December 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i3p48
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Describing 3-paths in normal plane maps
- Describing faces in plane triangulations
- Describing short paths in plane graphs of girth at least 5
- Weight of 3-paths in sparse plane graphs
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- Note on weights of paths in polyhedral graphs
- Colorings and girth of oriented planar graphs
- List edge and list total colourings of multigraphs
- A structural property of convex 3-polytopes
- On \(3\)-connected plane graphs without triangular faces
- Triangulated \(3\)-polytopes without faces of low weight
- Light subgraphs of graphs embedded in the plane. A survey
- Colorings of plane graphs: a survey
- On vertex-degree restricted paths in polyhedral graphs
- Note on 3-paths in plane graphs of girth 4
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Joint extension of two theorems of Kotzig on 3-polytopes
- Deeply asymmetric planar graphs
- Quelques consequences simples de la formule d'Euler
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- A Theorem on Planar Graphs
- Paths of low weight in planar graphs
- M-degrees of quadrangle-free planar graphs
- On the total coloring of planar graphs.
- Minimal vertex degree sum of a 3-path in plane maps
- On light subgraphs in plane graphs of minimum degree five
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Light paths in 4-connected graphs in the plane and other surfaces
- On the structure of plane graphs of minimum face size 5
- Paths with restricted degrees of their vertices in planar graphs
This page was built for publication: Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
