All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
From MaRDI portal
Publication:2361076
DOI10.1007/s00373-016-1755-2zbMath1365.05056OpenAlexW2559426121MaRDI QIDQ2361076
Oleg V. Borodin, Tsyndyma Chemit-Dorzhievna Batueva, Anna O. Ivanova
Publication date: 29 June 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1755-2
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Related Items
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
- An analogue of Franklin's theorem
- Light and low 5-stars in normal plane maps with minimum degree 5
- 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
- Describing 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- Describing 4-paths in 3-polytopes with minimum degree 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
- A structural property of convex 3-polytopes
- Light subgraphs of graphs embedded in the plane. A survey
- Note on 3-paths in plane graphs of girth 4
- 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
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- 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
- Paths with restricted degrees of their vertices in planar graphs
- Tight Descriptions of 3‐Paths in Normal Plane Maps
