The chromatic number of infinite graphs - A survey
From MaRDI portal
Publication:2275377
Cites work
- A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
- A Negative Partition Relation
- A note on chromatic number and connectivity of infinite graphs
- Chromatic numbers of subgraphs
- Connectivity and chromatic number of infinite graphs
- Consistency results on infinite graphs
- Cycles in graphs of uncountable chromatic number
- Finite subgraphs of uncountably chromatic graphs
- Forcing constructions for uncountably chromatic graphs
- Graph colorings and the axiom of choice
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- scientific article; zbMATH DE number 3468845 (Why is no real title available?)
- scientific article; zbMATH DE number 1795298 (Why is no real title available?)
- scientific article; zbMATH DE number 1388192 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- On incompactness for chromatic number of graphs
- On Taylor's problem
- The Colouring Number
- The list-chromatic number of infinite graphs
- The Ramsey property for graphs with forbidden complete subgraphs
- Two remarks on the coloring number
- What must and what need not be contained in a graph of uncountable chromatic number?
Cited in
(13)- Chromatic number of finite and infinite graphs and hypergraphs
- Connectivity and chromatic number of infinite graphs
- On the growth rate of dichromatic numbers of finite subdigraphs
- Infinite combinatorics plain and simple
- SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
- Trees, ladders and graphs
- Infinite stable graphs with large chromatic number
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Infinite stable graphs with large chromatic number. II
- Infinitely connected subgraphs in graphs of uncountable chromatic number
- Infinite cliques in simple and stable graphs
- Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
This page was built for publication: The chromatic number of infinite graphs - A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275377)