Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
From MaRDI portal
Publication:4446881
DOI10.1002/jgt.10144zbMath1031.05075OpenAlexW4235576149MaRDI QIDQ4446881
Riste Škrekovski, Bojan Mohar, Heinz-Juergen Voss
Publication date: 3 February 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10144
Related Items (41)
The height of faces of 3-polytopes ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ A Steinberg-like approach to describing faces in 3-polytopes ⋮ Heavy paths, light stars, and big melons ⋮ An analogue of Franklin's theorem ⋮ The weight of faces in normal plane maps ⋮ Unnamed Item ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ Another tight description of faces in plane triangulations with minimum degree 4 ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ Four gravity results ⋮ Light graphs in families of outerplanar graphs ⋮ Lightness, heaviness and gravity ⋮ Heights of minor faces in 3-polytopes ⋮ 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 ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Tight description of faces of triangulations on the torus ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ The vertex-face weight of edges in 3-polytopes ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ An extension of Franklin's theorem ⋮ More about the height of faces in 3-polytopes ⋮ On large light graphs in families of polyhedral graphs ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ 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 ⋮ 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 ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ 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 ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7 ⋮ Low faces of restricted degree in 3-polytopes
Cites Work
- On light cycles in plane triangulations
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- Note on the weight of paths in plane triangulations of minimum degree 4 and 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
This page was built for publication: Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
