Pages that link to "Item:Q2300155"
From MaRDI portal
The following pages link to The colouring number of infinite graphs (Q2300155):
Displaying 15 items.
- The list-chromatic number of infinite graphs (Q375873) (← links)
- Infinite friendship graphs with infinite parameters (Q918996) (← links)
- The complexity of infinite \(H\)-colouring (Q1333335) (← links)
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs (Q2033907) (← links)
- Proof of Halin's normal spanning tree conjecture (Q2130550) (← links)
- The quasi order of graphs on an ordinal (Q2275378) (← links)
- An infinite color analogue of Rado's theorem (Q2459498) (← links)
- Halin's end degree conjecture (Q2698436) (← links)
- Embedding Graphs into Colored Graphs (Q3808084) (← links)
- (Q4221701) (← links)
- Colorings of infinite graphs without one-colored rays (Q4888112) (← links)
- (Q5808059) (← links)
- Reverse mathematics and the coloring number of graphs (Q5963197) (← links)
- Applications of Order Trees in Infinite Graphs (Q6493755) (← links)
- Halin's end degree conjecture (Q6604676) (← links)