Distance graphs with maximum chromatic number

MaRDI QIDQ3576683zbMATH OpenFDO

Authors Oriol Serra, Javier Barajas

Publication date 30 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAE0134/0.html

zbMATH Keywords

chromatic numberdistance graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Distance graphs with maximum chromatic number
• The chromatic numbers of distance graphs
• scientific article; zbMATH DE number 528072
• scientific article; zbMATH DE number 1735660
• scientific article; zbMATH DE number 5026903

Cited in

(5)

• Distance graphs with large chromatic number and arbitrary girth
• Distance graphs with maximum chromatic number
• Graphs with chromatic number close to maximum degree
• Regular chromatic number and the lonely runner problem
• Some maximum multigraphs and adge/vertex distance colourings

This page was built for publication: Distance graphs with maximum chromatic number

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