Describing short paths in plane graphs of girth at least 5
From MaRDI portal
Publication:472958
DOI10.1016/j.disc.2014.09.014zbMath1302.05040OpenAlexW2038450909MaRDI QIDQ472958
Mária Maceková, Stanlislav Jendroľ
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Vertex degrees (05C07) Signed and weighted graphs (05C22)
Related Items (30)
All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ Weight of edges in normal plane maps ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ 3-paths in graphs with bounded average degree ⋮ An analogue of Franklin's theorem ⋮ Light subgraphs in graphs with average degree at most four ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ Light 3-stars in sparse plane graphs ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ An extension of Kotzig's theorem ⋮ Refined weight of edges in normal plane maps ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Weight of 3-paths in sparse plane graphs ⋮ Structure of edges of embedded graphs with minimum degree two ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ An extension of Franklin's theorem ⋮ More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges ⋮ Light graphs in planar graphs of large girth ⋮ Soft 3-stars in sparse plane graphs ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Structure of edges in plane graphs with bounded dual edge weight ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ 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 ⋮ Note on 3-paths in plane graphs of girth 4 ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps ⋮ Homogeneous colourings of graphs
Cites Work
This page was built for publication: Describing short paths in plane graphs of girth at least 5
