Pages that link to "Item:Q2448949"
From MaRDI portal
The following pages link to On incompactness for chromatic number of graphs (Q2448949):
Displaying 11 items.
- Chromatic numbers of graphs -- large gaps (Q313434) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- Two remarks on the coloring number (Q1362106) (← links)
- On the connectivity of infinite graphs (Q1705205) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- The chromatic number of infinite graphs - A survey (Q2275377) (← links)
- On incompactness for chromatic number of graphs (Q2448949) (← links)
- Erdős and set theory (Q2795207) (← links)
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs (Q5452164) (← links)
- STATIONARY REFLECTION (Q5855758) (← links)
- A club guessing toolbox. I (Q6670880) (← links)