The following pages link to Star chromatic number (Q3807231):
Displaying 50 items.
- The circular chromatic index (Q1883257) (← links)
- Star chromatic numbers of hypergraphs and partial Steiner triple systems (Q1903717) (← links)
- On the ultimate normalized chromatic difference sequence of a graph (Q1910556) (← links)
- Star-extremal graphs and the lexicographic product (Q1917490) (← links)
- On the bounds for the ultimate independence ratio of a graph (Q1923515) (← links)
- Circular coloring of planar digraphs (Q1928289) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- Asymptotic lower bounds on circular chromatic index of snarks (Q1953476) (← links)
- Arrangements, channel assignments, and associated polynomials (Q1961908) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- Coloring graphs by translates in the circle (Q2033887) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- The star dichromatic number (Q2062686) (← links)
- The circular chromatic numbers of signed series-parallel graphs (Q2065905) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Edge coloring of the signed generalized Petersen graph (Q2117562) (← links)
- Signed planar graphs with given circular chromatic numbers (Q2166279) (← links)
- On \(J\)-colorability of certain derived graph classes (Q2178741) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- Concepts of signed graph coloring (Q2225432) (← links)
- \(T\)-colorings, divisibility and the circular chromatic number (Q2227106) (← links)
- Circular chromatic indices of even degree regular graphs (Q2339432) (← links)
- On the odd girth and the circular chromatic number of generalized Petersen graphs (Q2359794) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- Optimal colorings with rainbow paths (Q2409512) (← links)
- Compact cyclic edge-colorings of graphs (Q2427500) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Several parameters of generalized Mycielskians (Q2495898) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Star chromatic numbers of graphs (Q2563519) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- Minimally circular-imperfect graphs with a major vertex (Q2581632) (← links)
- The star chromatic numbers of graph products (Q2717070) (← links)
- An analogue of Hajós' theorem for the circular chromatic number (Q2723478) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- Clique and chromatic number of circular-perfect graphs (Q2883567) (← links)
- Degrees and degree sequence of<i>k</i>-edge<i>d</i>-critical graphs (Q2895978) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- K4-free graphs with no odd hole: Even pairs and the circular chromatic number (Q3061190) (← links)
- The plane-width of graphs (Q3096959) (← links)
- Circular flows of nearly Eulerian graphs and vertex-splitting (Q3150192) (← links)
- Convex-round graphs are circular-perfect (Q3150195) (← links)
