Acyclic graph coloring and the complexity of the star chromatic number
From MaRDI portal
Publication:4693350
DOI10.1002/jgt.3190170202zbMath0830.05031OpenAlexW2161214751MaRDI QIDQ4693350
Publication date: 28 January 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190170202
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (20)
Strengthening topological colorful results for graphs ⋮ Circular chromatic number for iterated Mycielski graphs ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ Unnamed Item ⋮ Some theorems concerning the star chromatic number of a graph ⋮ Star-extremal graphs and the lexicographic product ⋮ 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 ⋮ Colorful paths for 3-chromatic graphs ⋮ Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs ⋮ Resource-sharing system scheduling and circular chromatic number ⋮ Circular chromatic number of signed graphs ⋮ A connection between circular colorings and periodic schedules ⋮ Star chromatic numbers of graphs ⋮ Circular chromatic numbers of Mycielski's graphs ⋮ Describing hereditary properties by forbidden circular orderings ⋮ Planar graphs with circular chromatic numbers between 3 and 4 ⋮ The star chromatic numbers of some planar graphs derived from wheels ⋮ Circular colouring and graph homomorphism
Cites Work
This page was built for publication: Acyclic graph coloring and the complexity of the star chromatic number
