A tight description of 3-polytopes by their major 3-paths
From MaRDI portal
Publication:2030764
Recommendations
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- An extension of Franklin's theorem
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
- Describing 4-paths in 3-polytopes with minimum degree 5
- Tight description of 4-paths in 3-polytopes with minimum degree 5
Cites work
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- An analogue of Franklin's theorem
- An extension of Franklin's theorem
- Describing 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Light subgraphs of graphs embedded in the plane. A survey
- Minimal vertex degree sum of a 3-path in plane maps
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- On light subgraphs in plane graphs of minimum degree five
- Paths with restricted degrees of their vertices in planar graphs
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
- Structural Properties of Planar Maps with the Minimal Degree 5
- Tight descriptions of 3-paths in normal plane maps
- Two variations of Franklin's theorem
- Weight of 3-paths in sparse plane graphs
Cited in
(4)
This page was built for publication: A tight description of 3-polytopes by their major 3-paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030764)
