Quasi-transitive K_-minor free graphs

DOI10.1016/J.EJC.2024.104056MaRDI QIDQ6655686zbMATH OpenFDO

Authors Matthias Hamann

Publication date 27 December 2024

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2024.104056

zbMATH Keywords

locally finite quasi-transitive graphplanar drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph minors (05C83)

Recommendations

• Minor exclusion in quasi-transitive graphs
• The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
• Coarse geometry of quasi-transitive graphs beyond planarity
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor

Cites work

• A Stallings type theorem for quasi-transitive graphs
• Canonical trees of tree-decompositions
• Coarse geometry of quasi-transitive graphs beyond planarity
• The Hadwiger number of infinite vertex-transitive graphs
• Vertex-transitive graphs and accessibility
• Über die Maximalzahl fremder unendlicher Wege in Graphen

Cited in

(3)

• Minor exclusion in quasi-transitive graphs
• Coarse geometry of quasi-transitive graphs beyond planarity
• The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

This page was built for publication: Quasi-transitive \(K_{\infty}\)-minor free graphs

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