Covering projective planar graphs with three forests

DOI10.1016/j.disc.2021.112748zbMath1486.05248OpenAlexW4200375905MaRDI QIDQ2075505

Ryuji Tazume, Raiji Mukae, Terukazu Sano, Kenta Ozeki

Publication date: 14 February 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112748

zbMATH Keywords

projective planecoverforestedge partition

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Covering planar graphs with forests, one having bounded maximum degree
• Covering planar graphs with forests
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Computing the orientable genus of projective graphs
• Edge‐maximal graphs on orientable and some nonorientable surfaces