On light subgraphs in plane graphs of minimum degree five
From MaRDI portal
Recommendations
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
- Light subgraphs in the family of 1-planar graphs with high minimum degree
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Light subgraphs of graphs embedded in the plane. A survey
- Strongly light subgraphs in the 1-planar graphs with minimum degree 7
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- Light graphs in planar graphs of large girth
- On the fixed edge of planar graphs with minimum degree five
- On the structure of plane graphs of minimum face size 5
- Light subgraphs in graphs with average degree at most four
Cited in
(56)- On light cycles in plane triangulations
- On \(3\)-connected plane graphs without triangular faces
- 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
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- Minor stars in plane graphs with minimum degree five
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- Heavy paths, light stars, and big melons
- A tight description of 3-polytopes by their major 3-paths
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
- Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
- On the structure of essentially-highly-connected polyhedral graphs
- All tight descriptions of 3-paths in plane graphs with girth 8
- 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
- An extension of Franklin's theorem
- Soft 3-stars in sparse plane graphs
- 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
- 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
- Low 5-stars in normal plane maps with minimum degree 5
- A note on the Roman bondage number of planar graphs
- On the existence of specific stars in planar graphs
- 5-stars of low weight in normal plane maps with minimum degree 5
- Light 3-stars in sparse plane graphs
- All tight descriptions of 3-paths in plane graphs with girth at least 7
- Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- An analogue of Franklin's theorem
- Light subgraphs in graphs with average degree at most four
- Light and low 5-stars in normal plane maps with minimum degree 5
- An extension of Kotzig's theorem
- Describing (d-2)-stars at d-vertices, d 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
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
- Light C₄ and C₅ in 3-polytopes with minimum degree 5
- Small minors in dense graphs
- scientific article; zbMATH DE number 1998295 (Why is no real title available?)
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- 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
- Light 3-paths in 3-polytopes without adjacent triangles
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
- 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
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
- On large light graphs in families of polyhedral graphs
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
This page was built for publication: On light subgraphs in plane graphs of minimum degree five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4347595)
