The circular altitude of a graph

MaRDI QIDQ4622623zbMATH OpenFDO

Authors John Bamberg, Alice Devillers, Irene Pivotto, Brian P. Corr, Daniel R. Hawtin, Eric Swartz

Publication date 13 February 2019

Full work available at URL https://arxiv.org/abs/1608.06127, http://ajc.maths.uq.edu.au/pdf/72/ajc_v72_p357.pdf

zbMATH Keywords

circular chromatic numberiterated Mycielskian

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: In this paper we investigate a parameter of graphs, called the circular altitude, introduced by Peter Cameron. We show that the circular altitude provides a lower bound on the circular chromatic number, and hence on the chromatic number, of a graph and investigate this parameter for the iterated Mycielskian of certain graphs.

Recommendations

• On the circular altitude of graphs
• Altitude of 4-regular circulants
• Circular chromatic number and a generalization of the construction of Mycielski.
• Circular coloring and Mycielski construction
• Circular chromatic number for iterated Mycielski graphs

Cites work

• Circular chromatic number: A survey
• scientific article; zbMATH DE number 6986950 (Why is no real title available?)
• Local chromatic number, Ky Fan's theorem, and circular colorings
• On (k,d)-colorings and fractional nowhere-zero flows
• Sur le coloriage des graphs

Cited in

(3)

• Altitude of 4-regular circulants
• On the circular altitude of graphs
• Altitude of wheels and wheel-like graphs

This page was built for publication: The circular altitude of a graph

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