Star chromatic numbers of graphs

DOI10.1007/BF01261328zbMath0860.05036MaRDI QIDQ2563519

Xuding Zhu, Eckhard Steffen

Publication date: 16 December 1996

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

chromatic numberstar chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

A revival of the girth conjecture ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some theorems concerning the star chromatic number of a graph ⋮ The circular chromatic index of graphs of high girth ⋮ The circular chromatic number of series-parallel graphs with large girth ⋮ Some star extremal circulant graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Coloring the Cartesian sum of graphs ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Planar graphs with circular chromatic numbers between 3 and 4 ⋮ Minimally circular-imperfect graphs with a major vertex ⋮ Circular colouring and graph homomorphism

Cites Work

• Unnamed Item
• Star-extremal graphs and the lexicographic product
• A note on the star chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• Uniquely Colourable Graphs with Large Girth
• The star chromatic number of a graph
• On (k,d)-colorings and fractional nowhere-zero flows
• Acyclic graph coloring and the complexity of the star chromatic number

This page was built for publication: Star chromatic numbers of graphs