Pages that link to "Item:Q4474287"

The following pages link to The circular chromatic number of a digraph (Q4474287):

Displaying 50 items.

• The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
• Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
• Two results on the digraph chromatic number (Q418896) (← links)
• Coloring digraphs with forbidden cycles (Q490994) (← links)
• The edge density of critical digraphs (Q519953) (← links)
• A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth (Q528972) (← links)
• Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
• Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
• Eigenvalues and colorings of digraphs (Q962116) (← links)
• The chromatic number of 5-valent circulants (Q998365) (← links)
• Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
• A connection between circular colorings and periodic schedules (Q1028150) (← links)
• Cycle reversions and dichromatic number in tournaments (Q1715622) (← links)
• Spectral radius of strongly connected digraphs (Q1759409) (← links)
• Circular coloring of planar digraphs (Q1928289) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
• The chromatic polynomial of a digraph (Q2056880) (← links)
• The star dichromatic number (Q2062686) (← links)
• Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
• On the dichromatic number of surfaces (Q2121762) (← links)
• The core of housing markets from an agent's perspective: Is it worth sprucing up your home? (Q2152118) (← links)
• The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)
• On the parameterized complexity of 2-partitions (Q2205943) (← links)
• Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
• On the growth rate of dichromatic numbers of finite subdigraphs (Q2286596) (← links)
• Coloring tournaments: from local to global (Q2312616) (← links)
• The removal lemma for tournaments (Q2421551) (← links)
• Spectral radius of digraphs with given dichromatic number (Q2431161) (← links)
• The distance spectral radius of digraphs (Q2444546) (← links)
• Acyclic subgraphs of planar digraphs (Q2517654) (← links)
• Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
• Uniquely \(D\)-colourable digraphs with large girth. II: Simplification via generalization (Q2656903) (← links)
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER (Q2971041) (← links)
• Planar Digraphs of Digirth Five Are 2-Colorable (Q2978182) (← links)
• Acyclic Digraphs (Q3120435) (← links)
• Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
• (Q4457550) (← links)
• On random digraphs and cores (Q4990132) (← links)
• Digraphs and Variable Degeneracy (Q5062115) (← links)
• On the Complexity of Digraph Colourings and Vertex Arboricity (Q5130735) (← links)
• On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs (Q5154626) (← links)
• Perfect Digraphs (Q5251198) (← links)
• Planar Digraphs of Digirth Four are 2-Colorable (Q5361236) (← links)
• (Q5463533) (← links)
• Complexity of stability in trading networks (Q6052977) (← links)
• Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number (Q6080117) (← links)
• Four proofs of the directed Brooks' theorem (Q6091815) (← links)
• Acyclic coloring of products of digraphs (Q6130210) (← links)
• The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number (Q6149177) (← links)