An extension of Franklin's theorem
From MaRDI portal
Publication:2201015
Recommendations
Cites work
- scientific article; zbMATH DE number 4135967 (Why is no real title available?)
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- An analogue 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
- 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
(7)- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- Light 3-paths in 3-polytopes without adjacent triangles
- A tight description of 3-polytopes by their major 3-paths
- Two variations of Franklin's theorem
- Tight description of 4-paths in 3-polytopes with minimum degree 5
- Describing 4-paths in 3-polytopes with minimum degree 5
- An analogue of Franklin's theorem
This page was built for publication: An extension of Franklin's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201015)
