Light 3-stars in embedded graphs

DOI10.1016/j.disc.2022.113256zbMath1506.05143OpenAlexW4309220285MaRDI QIDQ2111915

Roman Soták, K. Čekanová, Z. Šárošiová, 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

zbMATH Keywords

surfaceEuler characteristicgirthembedded graph3-star

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive constructions of small regular graphs of given degree and girth
• Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
• Light graphs in planar graphs of large girth
• All tight descriptions of 3-paths in plane graphs with girth at least 9
• Light subgraphs of graphs embedded in the plane. A survey
• 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
• Soft 3-stars in sparse plane graphs
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges

This page was built for publication: Light 3-stars in embedded graphs