Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
From MaRDI portal
Publication:973139
DOI10.1016/j.disc.2009.11.027zbMath1222.05217OpenAlexW2029817959MaRDI QIDQ973139
Tomáš Madaras, Barbora Ferencová
Publication date: 28 May 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.027
Related Items (31)
The height of faces of 3-polytopes ⋮ Weight of edges in normal plane maps ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ An analogue of Franklin's theorem ⋮ The weight of faces in normal plane maps ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ 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 ⋮ Heights of minor faces in 3-polytopes ⋮ 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 ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ The vertex-face weight of edges in 3-polytopes ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ More about the height of faces in 3-polytopes ⋮ All tight descriptions of 3-stars in 3-polytopes with girth 5 ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ On the weight of minor faces in triangle-free 3-polytopes ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Heights of minor faces in triangle-free 3-polytopes ⋮ Low edges in 3-polytopes ⋮ Low minor faces in 3-polytopes ⋮ 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 ⋮ Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 ⋮ Low faces of restricted degree in 3-polytopes ⋮ Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
Cites Work
- Lightness, heaviness and gravity
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- On large light graphs in families of polyhedral graphs
- On light cycles in plane triangulations
- The four-colour theorem
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- On \(3\)-connected plane graphs without triangular faces
- Heavy paths, light stars, and big melons
- Light subgraphs of graphs embedded in the plane. A survey
- On vertex-degree restricted paths in polyhedral graphs
- 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
- On the structure of plane graphs of minimum face size 5
- On light graphs in 3-connected plane graphs without triangular or quadrangular faces
- Unnamed Item
- Unnamed Item
This page was built for publication: Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
