An analogue of Franklin's theorem
From MaRDI portal
Publication:294562
DOI10.1016/J.DISC.2016.04.019zbMATH Open1339.05067OpenAlexW2395118107MaRDI QIDQ294562FDOQ294562
Authors: Oleg V. Borodin, Anna O. Ivanova 
Publication date: 16 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.04.019
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Cites Work
- Structural theorem on plane graphs with application to the entire coloring number
- 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 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- On light cycles in plane triangulations
- 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
- Title not available (Why is that?)
- 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
- On doubly light triangles in plane graphs
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- Structural Properties of Planar Maps with the Minimal Degree 5
- Minimal vertex degree sum of a 3-path in plane maps
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Title not available (Why is that?)
- On the structure of plane graphs of minimum face size 5
- 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
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- Weight of 3-paths in sparse plane graphs
Cited In (19)
- Soft 3-stars in sparse plane graphs
- Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
- Light 3-stars in sparse plane graphs
- Tight description of 4-paths in 3-polytopes with minimum degree 5
- Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
- A tight description of 3-polytopes by their major 3-paths
- All tight descriptions of 3-paths in plane graphs with girth 8
- An extension of Franklin's theorem
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- All tight descriptions of 3-paths in plane graphs with girth at least 7
- Light 3-paths in 3-polytopes without adjacent triangles
- Two variations of Franklin's theorem
- An analog of Nelson'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
This page was built for publication: An analogue of Franklin's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294562)
