Recommendations
- Light 3-stars in sparse plane graphs
- Unavoidable stars in 3-graphs
- Soft 3-stars in sparse plane graphs
- Embedded connectivity of \( (n, k)\)-star graphs
- Light 3-cycles in 1-planar graphs with degree restrictions
- Representing triangulated graphs in stars
- On a class of graphs without 3-stars
- Light edges in 1-planar graphs of minimum degree 3
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- On \(3^*\)-connected graphs
Cites work
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- scientific article; zbMATH DE number 2172910 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
- A Kotzig type theorem for non-orientable surfaces
- All tight descriptions of 3-paths in plane graphs with girth at least 9
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Graph theory
- Light graphs in planar graphs of large girth
- Light subgraphs of graphs embedded in the plane. A survey
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- Recursive constructions of small regular graphs of given degree and girth
- Soft 3-stars in sparse plane graphs
- Topological graph theory.
Cited in
(4)
This page was built for publication: Light 3-stars in embedded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111915)