What must and what need not be contained in a graph of uncountable chromatic number?
From MaRDI portal
(Redirected from Publication:794660)
Recommendations
- Short odd cycles in 4-chromatic graphs
- Small odd cycles in 4-chromatic graphs
- scientific article; zbMATH DE number 1067836
- Graphs with \(k\) odd cycle lengths
- Cycle lengths and chromatic number of graphs
- Cycle length parities and the chromatic number
- A strengthening on odd cycles in graphs of given chromatic number
- Cycle lengths in graphs with large minimum degree
- Edge condition for long cycles in bipartite graphs
- A bound on the chromatic number using the longest odd cycle length
Cites work
Cited in
(17)- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Infinite stable graphs with large chromatic number. II
- Trees, ladders and graphs
- Semialgebraic graphs having countable list-chromatic numbers
- An uncountably chromatic triple system
- Finite subgraphs of uncountably chromatic graphs
- Hajnal-Máté graphs, Cohen reals, and disjoint-type guessing
- Infinitely connected subgraphs in graphs of uncountable chromatic number
- The chromatic number of infinite graphs - A survey
- On Taylor's problem
- Infinite stable graphs with large chromatic number
- Forcing constructions for uncountably chromatic graphs
- A note on uncountable chordal graphs
- scientific article; zbMATH DE number 3987277 (Why is no real title available?)
- Chromatic numbers of graphs -- large gaps
- Chromatic number of finite and infinite graphs and hypergraphs
- On the growth rate of chromatic numbers of finite subgraphs
This page was built for publication: What must and what need not be contained in a graph of uncountable chromatic number?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794660)