Wohlquasigeordnete Klassen endlicher Graphen
From MaRDI portal
Publication:2544591
DOI10.1016/0095-8956(72)90015-9zbMATH Open0212.29404OpenAlexW2045403474MaRDI QIDQ2544591FDOQ2544591
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90015-9
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- On Independent Circuits Contained in a Graph
- Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
- Ordering by Divisibility in Abstract Algebras
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Bemerkungen zu Hadwigers Vermutung
- Anwendung einer Methode von K. Wagner bei Färbungsproblemen für Graphen
- Zusammenzüge und Unterteilungen von Graphen
- Zum Basisproblem für Graphenmengen, insbesondere für die nicht in die projektive Ebene einbettbaren Graphen
Cited In (7)
- Clique-width and well-quasi-ordering of triangle-free graph classes
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
- Well-quasi-orderings and sets of finite sequences
- Recent Progress on Well-Quasi-ordering Graphs
- Graphs without \(K_ 4\) and well-quasi-ordering
- Graph minors. IV: Tree-width and well-quasi-ordering
This page was built for publication: Wohlquasigeordnete Klassen endlicher Graphen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544591)
