Some theorems concerning the star chromatic number of a graph

DOI10.1006/JCTB.1996.1738zbMath0880.05042OpenAlexW1990891573MaRDI QIDQ1362095

Bing Zhou

Publication date: 12 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.1738

zbMATH Keywords

star-chromatic number

Mathematics Subject Classification ID

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

Related Items (3)

The circular chromatic number of induced subgraphs ⋮ Circular chromatic number and a generalization of the construction of Mycielski. ⋮ The star chromatic numbers of some planar graphs derived from wheels

Cites Work

• A hypergraph-free construction of highly chromatic graphs without short cycles
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Star chromatic numbers of graphs
• Graph Theory and Probability
• A note on the star chromatic number
• Star chromatic number
• Star chromatic numbers and products of graphs
• The star chromatic number of a graph
• Acyclic graph coloring and the complexity of the star chromatic number
• On chromatic number of finite set-systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Some theorems concerning the star chromatic number of a graph