Describing 4-paths in 3-polytopes with minimum degree 5
From MaRDI portal
Publication:511329
DOI10.1134/S0037446616050049zbMath1355.05091MaRDI QIDQ511329
Anna O. Ivanova, Oleg V. Borodin
Publication date: 15 February 2017
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Related Items (4)
All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
Cites Work
- Unnamed Item
- Unnamed Item
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- On doubly light triangles in plane graphs
- Describing 3-paths in normal plane maps
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- A structural property of convex 3-polytopes
- Light subgraphs of graphs embedded in the plane. A survey
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- 5-stars of low weight in normal plane maps with minimum degree 5
- Quelques consequences simples de la formule d'Euler
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- Structural Properties of Planar Maps with the Minimal Degree 5
- Minimal vertex degree sum of a 3-path in plane maps
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Structural theorem on plane graphs with application to the entire coloring number
- Paths with restricted degrees of their vertices in planar graphs
This page was built for publication: Describing 4-paths in 3-polytopes with minimum degree 5
