scientific article; zbMATH DE number 528072

MaRDI QIDQ4285228zbMATH OpenFDO

Authors Margit Voigt

Publication date 14 March 1994

zbMATH Keywords

chromatic numbercoloringdistance graphsEggleton-Erdős-Skilton probleminfinite graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic number of prime distance graphs
• Distance graphs with finite chromatic number
• Colouring prime distance graphs
• scientific article; zbMATH DE number 57114
• On a question concerning prime distance graphs

Cited in

(13)

• Chromatic number of finite and infinite graphs and hypergraphs
• Connectivity and chromatic number of infinite graphs
• Chromatic number of prime distance graphs
• On a question concerning prime distance graphs
• Coloring of integer distance graphs
• 2-distance colorings of integer distance graphs
• Distance graphs with maximum chromatic number
• Distance graphs with maximum chromatic number
• scientific article; zbMATH DE number 4099328 (Why is no real title available?)
• SPECTRA AND CHROMATIC NUMBERS OF INFINITE GRAPHS
• To an extremal problem on chromatic numbers of finite graphs
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• The list-chromatic number of infinite graphs defined on Euclidean spaces

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285228)