Cycles in graphs of uncountable chromatic number

DOI10.1007/BF02579349zbMath0523.05046OpenAlexW2052878613MaRDI QIDQ1056761

Carsten Thomassen

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579349

zbMATH Keywords

complete bipartite graphinfinite graphchromatic number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Infinite stable graphs with large chromatic number ⋮ The chromatic number of infinite graphs - A survey ⋮ What must and what need not be contained in a graph of uncountable chromatic number?

Cites Work

• On the combinatorial problems which I would most like to see solved
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• On chromatic number of graphs and set-systems

This page was built for publication: Cycles in graphs of uncountable chromatic number