Some theorems concerning the star chromatic number of a graph
From MaRDI portal
Publication:1362095
DOI10.1006/JCTB.1996.1738zbMATH Open0880.05042OpenAlexW1990891573MaRDI QIDQ1362095FDOQ1362095
Authors: 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
Recommendations
Cites Work
- Graph Theory and Probability
- Star chromatic number
- Star chromatic numbers and products of graphs
- Acyclic graph coloring and the complexity of the star chromatic number
- On chromatic number of finite set-systems
- A hypergraph-free construction of highly chromatic graphs without short cycles
- A note on the star chromatic number
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Star chromatic numbers of graphs
- Title not available (Why is that?)
- The star chromatic number of a graph
- Title not available (Why is that?)
Cited In (15)
- On the star chromatic index of generalized Petersen graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The star chromatic numbers of some graphs.
- Some planar graphs with star chromatic number between three and four
- Circular chromatic number and a generalization of the construction of Mycielski.
- The star chromatic numbers of some planar graphs derived from wheels
- The star chromatic number of general Mycielski graphs of paths and cycles
- Some results on incidence coloring, star arboricity and domination number
- The circular chromatic number of induced subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Star chromatic numbers of some planar graphs
- Title not available (Why is that?)
- On \(d_2\)-coloring of certain families of graphs
This page was built for publication: Some theorems concerning the star chromatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362095)
