A generalisation of a theorem of de Bruijn and Erdős on the chromatic numbers of infinite graphs

DOI10.1016/0095-8956(75)90044-1zbMath0277.05112OpenAlexW1971437982WikidataQ60680300 ScholiaQ60680300MaRDI QIDQ1393406

John Lake

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90044-1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The role of the Axiom of Choice in proper and distinguishing colourings

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A generalisation of a theorem of de Bruijn and Erdős on the chromatic numbers of infinite graphs