Pages that link to "Item:Q794660"
From MaRDI portal
The following pages link to What must and what need not be contained in a graph of uncountable chromatic number? (Q794660):
Displaying 9 items.
- Trees, ladders and graphs (Q490986) (← links)
- Infinitely connected subgraphs in graphs of uncountable chromatic number (Q681605) (← links)
- Chromatic number of finite and infinite graphs and hypergraphs (Q1059084) (← links)
- On Taylor's problem (Q1912691) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- Semialgebraic graphs having countable list-chromatic numbers (Q2790252) (← links)
- Forcing constructions for uncountably chromatic graphs (Q3804690) (← links)
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY (Q4288049) (← links)
- Infinite stable graphs with large chromatic number (Q5036100) (← links)
