Decomposing infinite graphs

DOI10.1016/0012-365X(91)90330-5zbMath0759.05069MaRDI QIDQ1191914

Reinhard Diestel

Publication date: 27 September 1992

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

zbMATH Keywords

minorinfinite graphsimplicial decomposition

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) Graph theory (05C99)

Related Items (3)

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ 3-connected planar spaces uniquely embed in the sphere

Cites Work

• Simplicial tree-decompositions of infinite graphs. III: The uniqueness of prime decompositions
• Bemerkungen zu Hadwigers Vermutung
• Graph minors. V. Excluding a planar graph
• Tree-decompositions, tree-representability and chordal graphs
• Simplicial decompositions of graphs: A survey of applications
• Excluding infinite minors
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
• Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Über einen Satz von K.Wagner zum Vierfarbenproblem
• Simplicial tree-decompositions of infinite graphs. I
• Simplicial tree-decompositions of infinite graphs. II: The existence of prime decompositions
• Über eine Eigenschaft der ebenen Komplexe
• Simplicial minors and decompositions of graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Ein Zerlegungssatz für unendliche Graphen und seine Anwendung auf Homomorphiebasen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing infinite graphs