A note on the star chromatic number
From MaRDI portal
Publication:3487411
DOI10.1002/jgt.3190140412zbMath0706.05022MaRDI QIDQ3487411
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140412
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, Unnamed Item, The circular chromatic index of graphs of high girth, On defining numbers of circular complete graphs, An analogue of Dirac's theorem on circular super-critical graphs, On minimally circular-imperfect graphs, Density and power graphs in graph homomorphism problem, Coloring the Cartesian sum of graphs, Paths, cycles and circular colorings in digraphs, Triangle-free strongly circular-perfect graphs, The circular chromatic number of hypergraphs, A generalization of the Erdős-Ko-Rado theorem, Inequalities with respect to graph homomorphism, Fractional multiples of graphs and the density of vertex-transitive graphs, Circular chromatic numbers of Mycielski's graphs, Planar graphs with circular chromatic numbers between 3 and 4, Independence ratios of graph powers, Star chromatic number of triangle-free planar graphs, Some theorems concerning the star chromatic number of a graph, Some star extremal circulant graphs, Circular chromatic number and a generalization of the construction of Mycielski., Homomorphisms from sparse graphs with large girth., On the fractional chromatic number and the lexicographic product of graphs, The star chromatic numbers of some planar graphs derived from wheels, Resource-sharing system scheduling and circular chromatic number, A revival of the girth conjecture, The circular chromatic number of induced subgraphs, The circular chromatic index, Chromatic invariants for finite graphs: Theme and polynomial variations, Star chromatic numbers of hypergraphs and partial Steiner triple systems, On the ultimate normalized chromatic difference sequence of a graph, Star-extremal graphs and the lexicographic product, On the bounds for the ultimate independence ratio of a graph, Circular chromatic numbers of distance graphs with distance sets missing multiples, Compact cyclic edge-colorings of graphs, On the adaptable chromatic number of graphs, Minimal circular-imperfect graphs of large clique number and large independence number, On classes of minimal circular-imperfect graphs, Extending precolorings to circular colorings, Independence and coloring properties of direct products of some vertex-transitive graphs, Star chromatic numbers of graphs, Coloring of distance graphs with intervals as distance sets, Minimally circular-imperfect graphs with a major vertex, An analogue of Hajós’ Theorem for the circular chromatic number, Circular flows of nearly Eulerian graphs and vertex-splitting, Projectivity and independent sets in powers of graphs, Convex-round graphs are circular-perfect, On strongly circular-perfectness, Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract, Circular-imperfection of triangle-free graphs, Circular colouring and graph homomorphism
