On light subgraphs in plane graphs of minimum degree five
From MaRDI portal
Publication:4347595
DOI10.7151/dmgt.1035zbMath0877.05050OpenAlexW2043884275MaRDI QIDQ4347595
Tomáš Madaras, Stanlislav Jendroľ
Publication date: 8 December 1997
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/493323e1a313d4b7b9e6119b36b05eae95bbf859
Three-dimensional polytopes (52B10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items (54)
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ Heavy paths, light stars, and big melons ⋮ An analogue of Franklin's theorem ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ A note on the Roman bondage number of planar graphs ⋮ Light 3-stars in sparse plane graphs ⋮ Light and low 5-stars in normal plane maps with minimum degree 5 ⋮ Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5 ⋮ 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 ⋮ Four gravity results ⋮ The structure of 1-planar graphs ⋮ Light graphs in families of outerplanar graphs ⋮ Lightness, heaviness and gravity ⋮ Light stars in large polyhedral maps on surfaces ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ On the structure of essentially-highly-connected polyhedral graphs ⋮ The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 ⋮ Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices ⋮ Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 ⋮ 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 ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7 ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices ⋮ Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9 ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ Small minors in dense graphs ⋮ An extension of Franklin's theorem ⋮ Soft 3-stars in sparse plane graphs ⋮ Minor stars in plane graphs with minimum degree five ⋮ On the existence of specific stars in planar graphs ⋮ All tight descriptions of 3-stars in 3-polytopes with girth 5 ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices ⋮ On large light graphs in families of polyhedral graphs ⋮ Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight ⋮ 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 ⋮ 5-stars of low weight in normal plane maps with minimum degree 5 ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ Light minor 5-stars in 3-polytopes with minimum degree 5 ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 ⋮ On light cycles in plane triangulations ⋮ Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
This page was built for publication: On light subgraphs in plane graphs of minimum degree five
