Pages that link to "Item:Q5931460"

The following pages link to Circular chromatic number: A survey (Q5931460):

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)
• A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
• Square-free graphs are multiplicative (Q345100) (← links)
• Constructing uniquely realizable graphs (Q393739) (← links)
• Resource-sharing systems and hypergraph colorings (Q411210) (← links)
• Cyclic orderings and cyclic arboricity of matroids (Q414636) (← links)
• Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
• On the chromatic number of general Kneser hypergraphs (Q490992) (← links)
• Towers for commuting endomorphisms, and combinatorial applications (Q507074) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
• Colorful paths for 3-chromatic graphs (Q512581) (← links)
• Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
• Interleaved adjoints of directed graphs (Q648963) (← links)
• The fractional version of Hedetniemi's conjecture is true (Q648973) (← links)
• Circular flow on signed graphs (Q651035) (← links)
• Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← 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)
• Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← 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)
• Minmax relations for cyclically ordered digraphs (Q885290) (← 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)
• Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
• On the restricted homomorphism problem (Q948709) (← links)
• Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757) (← links)
• Cyclic orders: equivalence and duality (Q949788) (← links)
• Circular coloring and Mycielski construction (Q968430) (← links)
• Coloring the Cartesian sum of graphs (Q998323) (← links)
• Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
• Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
• Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers (Q1025479) (← 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)
• Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
• Adaptable chromatic number of graph products (Q1045010) (← links)
• The circular chromatic number of hypergraphs (Q1045069) (← links)
• Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
• Circular chromatic number of Kneser graphs (Q1400965) (← links)