Describing short paths in plane graphs of girth at least 5
DOI10.1016/J.DISC.2014.09.014zbMATH Open1302.05040OpenAlexW2038450909MaRDI QIDQ472958FDOQ472958
Authors: Stanislav Jendroľ, Mária Maceková 
Publication date: 20 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.09.014
Recommendations
- Note on 3-paths in plane graphs of girth 4
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- Weight of 3-paths in sparse plane graphs
- All tight descriptions of 3-paths in plane graphs with girth at least 9
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Signed and weighted graphs (05C22) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
Cited In (32)
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
- Weight of edges in normal plane maps
- 3-paths in graphs with bounded average degree
- Soft 3-stars in sparse plane graphs
- All tight descriptions of 3-paths in plane graphs with girth at least 9
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
- On the structure of plane graphs of minimum face size 5
- Paths with restricted degrees of their vertices in planar graphs
- Light 3-stars in sparse plane graphs
- Homogeneous colourings of graphs
- An analogue of Franklin's theorem
- Light subgraphs in graphs with average degree at most four
- Light graphs in planar graphs of large girth
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- A tight description of 3-polytopes by their major 3-paths
- All tight descriptions of 3-paths in plane graphs with girth 8
- Structure of edges of embedded graphs with minimum degree two
- An extension of Franklin's theorem
- Weight of 3-paths in sparse plane graphs
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- Structure of edges in plane graphs with bounded dual edge weight
- 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
- An extension of Kotzig's theorem
- Note on 3-paths in plane graphs of girth 4
- Tight descriptions of 3-paths in normal plane maps
- Refined weight of edges in normal plane maps
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
- Low 5-stars in normal plane maps with minimum degree 5
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
This page was built for publication: Describing short paths in plane graphs of girth at least 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472958)
