Pages that link to "Item:Q1836671"

The following pages link to The dichromatic number of a digraph (Q1836671):

Displaying 50 items.

• Reducing the dichromatic number via cycle reversions in infinite digraphs (Q2225401) (← 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)
• Hajós and Ore constructions for digraphs (Q2309234) (← links)
• Coloring tournaments: from local to global (Q2312616) (← links)
• Infinite quasi-transitive digraphs with domination number 2 (Q2357773) (← links)
• A flow theory for the dichromatic number (Q2403695) (← links)
• Disproof of a conjecture of Neumann-Lara (Q2409837) (← links)
• Spectral radius of digraphs with given dichromatic number (Q2431161) (← links)
• The distance spectral radius of digraphs (Q2444546) (← links)
• Achromatic numbers for circulant graphs and digraphs (Q2656326) (← links)
• The NL-flow polynomial (Q2664009) (← links)
• Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER (Q2971041) (← links)
• Planar Digraphs of Digirth Five Are 2-Colorable (Q2978182) (← links)
• Tournaments and Semicomplete Digraphs (Q3120434) (← links)
• Miscellaneous Digraph Classes (Q3120443) (← links)
• Bounds for the dichromatic number of a generalized lexicographic product of digraphs (Q3178167) (← links)
• (Q3303537) (← links)
• Infinite families of -dichromatic vertex critical circulant tournaments (Q3439577) (← links)
• On a Conjecture of Víctor Neumann-Lara (Q3503552) (← links)
• (Q4953557) (← links)
• A semi-strong perfect digraph theorem (Q4956212) (← links)
• Results on uniquely colorable digraphs (Q5025146) (← links)
• Heroes in Orientations of Chordal Graphs (Q5043055) (← links)
• Digraphs and Variable Degeneracy (Q5062115) (← links)
• (Q5121891) (← 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)
• Relations between the Local Chromatic Number and Its Directed Version (Q5265337) (← links)
• Planar Digraphs of Digirth Four are 2-Colorable (Q5361236) (← links)
• Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
• Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas (Q5882209) (← links)
• Strong complete minors in digraphs (Q5886331) (← links)
• Algorithms for finding maximum transitive subtournaments (Q5963652) (← links)
• Complete directed minors and chromatic number (Q6046643) (← links)
• On coloring digraphs with forbidden induced subgraphs (Q6074583) (← links)
• The smallest 5-chromatic tournament (Q6076253) (← links)
• Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number (Q6080117) (← links)
• Tutte polynomials for regular oriented matroids (Q6080143) (← links)
• Four proofs of the directed Brooks' theorem (Q6091815) (← links)
• Acyclic coloring of products of digraphs (Q6130210) (← links)
• Digraph redicolouring (Q6146501) (← links)
• The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number (Q6149177) (← links)
• On inducing degenerate sums through 2-labellings (Q6154381) (← links)
• Subdivisions with congruence constraints in digraphs of large chromatic number (Q6183432) (← links)
• Heroes in oriented complete multipartite graphs (Q6199386) (← links)
• Geometric and spectral analysis on weighted digraphs (Q6199678) (← links)
• Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring (Q6201022) (← links)