The Kuratowski covering conjecture for graphs of order < 10 for the nonorientable surfaces of genus 3 and 4

zbMATH Open1163.05010arXiv0808.0357MaRDI QIDQ3616670

Suhkjin Hur

Publication date: 26 March 2009

Abstract: Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a finite minimal forbidden subgraph for the nonorientable surface of genus g can be written as the union of g+1 Kuratowski subgraphs such that the union of each pair of these fails to embed in the projective plane, the union of each triple of these fails to embed in the Klein bottle if g >= 2, and the union of each triple of these fails to embed in the torus if g >= 3. We show that this conjecture is true for all minimal forbidden subgraphs of order < 10 for the nonorientable surfaces of genus 3 and 4.

Full work available at URL: https://arxiv.org/abs/0808.0357

zbMATH Keywords

embeddinggenusnonorientable surfaceKuratowski subgraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Pósa's conjecture for graphs of order at least 2 × 10⁸

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On total covers of graphs 👍 👎
• On covers of graphs 👍 👎
• Coverings of \(k\)-graphs 👍 👎
• On covers of graphs 👍 👎
• On some covering graphs of a graph 👍 👎

This page was built for publication: The Kuratowski covering conjecture for graphs of order < 10 for the nonorientable surfaces of genus 3 and 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616670)