The list-chromatic number of infinite graphs
From MaRDI portal
Publication:375873
Recommendations
Cites work
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3877173 (Why is no real title available?)
- scientific article; zbMATH DE number 1113072 (Why is no real title available?)
- scientific article; zbMATH DE number 866056 (Why is no real title available?)
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- Cardinal addition and the axiom of choice
- Fragile measurability
- Iterated perfect-set forcing
- On chromatic number of graphs and set-systems
- Proper forcing
- Set theory. An introduction to independence proofs
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
- The Colouring Number
- The Law of Infinite Cardinal Addition is Weaker than the Axiom of Choice
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- The odd-distance plane graph
Cited in
(11)- Semialgebraic graphs having countable list-chromatic numbers
- The colouring number of infinite graphs
- Infinite friendship graphs with infinite parameters
- Lower bounds on coloring numbers from hardness hypotheses in pcf theory
- The list-chromatic number of infinite graphs defined on Euclidean spaces
- Cardinal invariants of closed graphs
- Infinitely connected subgraphs in graphs of uncountable chromatic number
- The chromatic number of infinite graphs - A survey
- List edge chromatic number of graphs with large girth
- List-compactness of infinite directed graphs
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
This page was built for publication: The list-chromatic number of infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375873)