Light 3-stars in embedded graphs
DOI10.1016/J.DISC.2022.113256zbMATH Open1506.05143OpenAlexW4309220285MaRDI QIDQ2111915FDOQ2111915
Authors: K. Čekanová, Z. Šárošiová, Roman Soták, Mária Maceková 
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113256
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Graph theory
- Light subgraphs of graphs embedded in the plane. A survey
- Topological graph theory.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Kotzig type theorem for non-orientable surfaces
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- Title not available (Why is that?)
- Light graphs in planar graphs of large girth
- Recursive constructions of small regular graphs of given degree and girth
- All tight descriptions of 3-paths in plane graphs with girth at least 9
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
- Soft 3-stars in sparse plane graphs
Cited In (2)
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)
