An extension of Franklin's theorem
From MaRDI portal
Publication:2201015
DOI10.33048/SEMI.2020.17.105zbMATH Open1443.05160OpenAlexW3114176203MaRDI QIDQ2201015FDOQ2201015
Authors: Oleg V. Borodin, Anna O. Ivanova 
Publication date: 24 September 2020
Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2020.17.105
Recommendations
Cites Work
- Light subgraphs of graphs embedded in the plane. A survey
- 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
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- An analogue of Franklin's theorem
- Title not available (Why is that?)
- 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
- Two variations of Franklin's theorem
- Weight of 3-paths in sparse plane graphs
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
Cited In (7)
- Tight description of 4-paths in 3-polytopes with minimum degree 5
- An analogue of Franklin's theorem
- A tight description of 3-polytopes by their major 3-paths
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- Light 3-paths in 3-polytopes without adjacent triangles
- Two variations of Franklin's theorem
- Describing 4-paths in 3-polytopes with minimum degree 5
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)
