Pages that link to "Item:Q1836671"

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

Displaying 50 items.

• Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
• Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
• Towards a flow theory for the dichromatic number (Q322198) (← links)
• Dichromatic polynomial of product digraphs (Q327643) (← links)
• Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
• Two results on the digraph chromatic number (Q418896) (← links)
• On the acyclic disconnection of multipartite tournaments (Q427897) (← links)
• Coloring digraphs with forbidden cycles (Q490994) (← links)
• Colorings and spectral radius of digraphs (Q501071) (← links)
• The dichromatic number of infinite families of circulant tournaments (Q503681) (← links)
• The edge density of critical digraphs (Q519953) (← links)
• The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233) (← 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)
• A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments (Q960957) (← links)
• Eigenvalues and colorings of digraphs (Q962116) (← links)
• Directed defective asymmetric graph coloring games (Q968138) (← links)
• Lightness of digraphs in surfaces and directed game chromatic number (Q1025549) (← links)
• On kernel-perfect critical digraphs (Q1076036) (← links)
• Uniquely colourable m-dichromatic oriented graphs (Q1088673) (← links)
• On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
• Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
• Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
• The acyclic disconnection of a digraph (Q1292866) (← links)
• The 3 and 4-dichromatic tournaments of minimum order (Q1343264) (← links)
• Vertex critical 4-dichromatic circulant tournaments (Q1363679) (← links)
• On the achromatic number of signed graphs (Q1711838) (← links)
• Spectral radius of strongly connected digraphs (Q1759409) (← links)
• The diachromatic number of digraphs (Q1784278) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• A note on coloring digraphs of large girth (Q2004076) (← links)
• Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
• Majority colorings of sparse digraphs (Q2030755) (← links)
• A Cvetković-type theorem for coloring of digraphs (Q2052174) (← links)
• The chromatic polynomial of a digraph (Q2056880) (← links)
• Dichromatic number and forced subdivisions (Q2072176) (← links)
• Colorings in digraphs from the spectral radius (Q2080237) (← links)
• Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded (Q2094868) (← links)
• Colouring non-even digraphs (Q2094875) (← links)
• A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
• Game-perfect semiorientations of forests (Q2118241) (← links)
• Cycles in color-critical graphs (Q2121717) (← links)
• On the dichromatic number of surfaces (Q2121762) (← links)
• The dichromatic polynomial of a digraph (Q2127720) (← links)
• Chordal directed graphs are not \(\chi\)-bounded (Q2138574) (← links)
• The digrundy number of digraphs (Q2142695) (← links)
• On extremal spectral results of digraphs based on sum distance (Q2166213) (← links)
• Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
• The minimum number of edges in 4-critical digraphs of given order (Q2175801) (← links)