Infinitely connected subgraphs in graphs of uncountable chromatic number

DOI10.1007/S00493-016-3436-4zbMath1413.05124OpenAlexW2345403094WikidataQ56926499 ScholiaQ56926499MaRDI QIDQ681605

Carsten Thomassen

Publication date: 12 February 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/2a40e941-8bd7-4f9b-a41c-48dc0495fc2e

zbMATH Keywords

uncountable chromatic number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Infinite graphs (05C63)

Related Items (1)

On a result of Thomassen

Cites Work

• The list-chromatic number of infinite graphs
• A note on chromatic number and connectivity of infinite graphs
• Trees, ladders and graphs
• What must and what need not be contained in a graph of uncountable chromatic number?
• Connectivity and chromatic number of infinite graphs
• The chromatic number of infinite graphs - A survey
• On the degrees of the vertices of a directed graph
• On chromatic number of graphs and set-systems

This page was built for publication: Infinitely connected subgraphs in graphs of uncountable chromatic number