Structure of edges of embedded graphs with minimum degree two
From MaRDI portal
Publication:6057637
DOI10.1002/jgt.22834zbMath1521.05121OpenAlexW4226198233MaRDI QIDQ6057637
Mária Maceková, Unnamed Author, Roman Soták
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22834
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
- Weight of edges in normal plane maps
- An extension of Kotzig's theorem
- Recursive constructions of small regular graphs of given degree and girth
- Describing short paths in plane graphs of girth at least 5
- Light subgraphs of graphs embedded in the plane. A survey
- On the total coloring of planar graphs.
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item