The following pages link to Star chromatic number (Q3807231):
Displaying 50 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- First non-trivial upper bound on circular chromatic number of the plane (Q322359) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- Resource-sharing systems and hypergraph colorings (Q411210) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- Homomorphisms from sparse graphs to the Petersen graph (Q709319) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Circular list colorings of some graphs (Q815980) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- On defining numbers of circular complete graphs (Q864158) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- An analogue of Dirac's theorem on circular super-critical graphs (Q875063) (← links)
- The circular chromatic index of some Class 2 graphs (Q878640) (← links)
- Circular total chromatic numbers of graphs (Q898151) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- Density and power graphs in graph homomorphism problem (Q932664) (← links)
- Circular coloring and Mycielski construction (Q968430) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- The complexity of nonrepetitive coloring (Q1003751) (← links)
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Circular choosability is rational (Q1026015) (← links)
- A connection between circular colorings and periodic schedules (Q1028150) (← links)
- On colorings of graph powers (Q1043947) (← links)
- Circular game chromatic number of graphs (Q1043981) (← links)
- The circular chromatic number of hypergraphs (Q1045069) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Star chromatic number of triangle-free planar graphs (Q1324451) (← links)
- Some theorems concerning the star chromatic number of a graph (Q1362095) (← links)
- Circular chromatic number of Kneser graphs (Q1400965) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- Circular chromatic number and a generalization of the construction of Mycielski. (Q1417963) (← links)
- Homomorphisms from sparse graphs with large girth. (Q1425115) (← links)
- Interference patterns in bijective colorings of 2-regular graphs (Q1566572) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- The star chromatic numbers of some planar graphs derived from wheels (Q1601230) (← links)
- Packing spanning trees in highly essentially connected graphs (Q1618210) (← links)
- Density of 5/2-critical graphs (Q1705839) (← links)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- Upper bound on the circular chromatic number of the plane (Q1753019) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Circular chromatic number for iterated Mycielski graphs (Q1877680) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- The circular chromatic number of induced subgraphs (Q1880798) (← links)
