Applications of Order Trees in Infinite Graphs
From MaRDI portal
Recommendations
Cites work
- A unified existence theorem for normal spanning trees
- Clique-sums, tree-decompositions and compactness
- Decompositions of edge-colored infinite complete graphs into monochromatic paths
- Decompositions of edge-coloured infinite complete graphs into monochromatic paths. II
- Excluding infinite minors
- scientific article; zbMATH DE number 1533074 (Why is no real title available?)
- Minimal obstructions for normal spanning trees
- Non-separable Borel, sets, II
- Normal Spanning Trees, Aronszajn Trees and Excluded Minors
- On the growth rate of chromatic numbers of finite subgraphs
- On σ-Discreteness and Borel Isomorphism
- Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
- The colouring number of infinite graphs
- Trees, ladders and graphs
- Wurzelbäume und unendliche Wege in Graphen
- Zusammenzüge und Unterteilungen von Graphen
- Über die Maximalzahl fremder unendlicher Wege in Graphen
This page was built for publication: Applications of Order Trees in Infinite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493755)