A tight description of 3-polytopes by their major 3-paths
From MaRDI portal
Publication:2030764
DOI10.1134/S0037446621030022zbMath1465.05045OpenAlexW3171945737MaRDI QIDQ2030764
Anna O. Ivanova, Oleg V. Borodin
Publication date: 7 June 2021
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446621030022
Cites Work
- Unnamed Item
- An analogue of Franklin's theorem
- Describing 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
- Weight of 3-paths in sparse plane graphs
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- Light subgraphs of graphs embedded in the plane. A survey
- An extension of Franklin's theorem
- 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
- 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
- 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
This page was built for publication: A tight description of 3-polytopes by their major 3-paths
