Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract

DOI10.1016/J.ENDM.2007.01.078MaRDI QIDQ3439626zbMATH OpenOpenAlexFDO

Authors Nicolas Roussel, André Raspaud

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.01.078

zbMATH Keywords

circular chromatic number

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Circular \((5,2)\)-coloring of sparse graphs
• The fractional chromatic number of graphs of maximum degree at most three
• Triangle-free graphs with large chromatic numbers
• On the chromatic number of triangle-free graphs of large minimum degree
• The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)

Cites work

• A note on the star chromatic number
• Circular chromatic number: A survey
• Star chromatic number

Cited in

(2)

• Circular chromatic number of triangle-free hexagonal graphs
• Circular chromatic number of triangle-free hexagonal graphs

This page was built for publication: Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract

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