A note on the star chromatic number
From MaRDI portal
Publication:3487411
Recommendations
Cited in
(78)- 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
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs
- 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
- Asymptotic lower bounds on circular chromatic index of snarks
- Circular chromatic numbers of distance graphs with distance sets missing multiples
- On \(t\)-relaxed 2-distant circular coloring of graphs
- Signed planar graphs with given circular chromatic numbers
- On circular-perfect graphs: a survey
- Circular vertex arboricity
- 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 the theta number of powers of cycle graphs
- 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
- Some planar graphs with star chromatic number between three and four
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
- Clique and chromatic number of circular-perfect graphs
- Degrees and degree sequence of k-edge d-critical graphs
- \(K_{4}\)-free graphs with no odd hole: even pairs and the circular chromatic number
- Short proofs for two theorems of Chien, Hell and Zhu
- Circular flows of nearly Eulerian graphs and vertex-splitting
- Projectivity and independent sets in powers of graphs
- Convex-round graphs are circular-perfect
- scientific article; zbMATH DE number 7228907 (Why is no real title available?)
- On strongly circular-perfectness
- Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract
- Mixing homomorphisms, recolorings, and extending circular precolorings
- A note on circular chromatic number of graphs with large girth and similar problems
- Circular-imperfection of triangle-free graphs
- Computing clique and chromatic number of circular-perfect graphs in polynomial time
- Circular colouring and graph homomorphism
- scientific article; zbMATH DE number 718665 (Why is no real title available?)
- Graph information ratio
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- scientific article; zbMATH DE number 861320 (Why is no real title available?)
- scientific article; zbMATH DE number 1420226 (Why is no real title available?)
- The circular chromatic number of series-parallel graphs with large girth
- Circular chromatic number: A survey
- Construction of sparse graphs with prescribed circular colorings
- Circular coloring and fractional coloring in planar graphs
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
- Extending precolourings of circular cliques
- Hedetniemi's conjecture and adjoint functors in thin categories
- 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
This page was built for publication: A note on the star chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487411)
