The dichromatic number of a digraph
From MaRDI portal
Publication:1836671
DOI10.1016/0095-8956(82)90046-6zbMath0506.05031OpenAlexW2035195165MaRDI QIDQ1836671
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(82)90046-6
Related Items
Heroes in oriented complete multipartite graphs, Geometric and spectral analysis on weighted digraphs, Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring, On kernel-perfect critical digraphs, Infinite quasi-transitive digraphs with domination number 2, Cycles in color-critical graphs, On the dichromatic number of surfaces, Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas, Strong complete minors in digraphs, Homomorphisms and colourings of oriented graphs: an updated survey, The dichromatic polynomial of a digraph, Heroes in Orientations of Chordal Graphs, Acyclic coloring parameterized by directed clique-width, Finding good 2-partitions of digraphs. I. Hereditary properties, Uniquely colourable m-dichromatic oriented graphs, The 3 and 4-dichromatic tournaments of minimum order, Chordal directed graphs are not \(\chi\)-bounded, Unnamed Item, The digrundy number of digraphs, Bounds for the dichromatic number of a generalized lexicographic product of digraphs, Towards a flow theory for the dichromatic number, Digraphs and Variable Degeneracy, Unnamed Item, Dichromatic polynomial of product digraphs, Colourings, homomorphisms, and partitions of transitive digraphs, Vertex critical 4-dichromatic circulant tournaments, On extremal spectral results of digraphs based on sum distance, Colorings of oriented planar graphs avoiding a monochromatic subgraph, Achromatic numbers for circulant graphs and digraphs, A flow theory for the dichromatic number, On constructive methods in the theory of colour-critical graphs, The NL-flow polynomial, The minimum number of edges in 4-critical digraphs of given order, Disproof of a conjecture of Neumann-Lara, Decomposing and colouring some locally semicomplete digraphs, Complete directed minors and chromatic number, On coloring digraphs with forbidden induced subgraphs, The smallest 5-chromatic tournament, Game-perfect digraphs, Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number, Tutte polynomials for regular oriented matroids, On a Conjecture of Víctor Neumann-Lara, Four proofs of the directed Brooks' theorem, Various bounds on the minimum number of arcs in a \(k\)-dicritical digraph, Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees, Acyclic coloring of products of digraphs, Digraph redicolouring, The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number, Two results on the digraph chromatic number, On inducing degenerate sums through 2-labellings, Planar Digraphs of Digirth Four are 2-Colorable, Subdivisions with congruence constraints in digraphs of large chromatic number, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\), On the acyclic disconnection of multipartite tournaments, Spectral radius of digraphs with given dichromatic number, DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER, On the achromatic number of signed graphs, Planar Digraphs of Digirth Five Are 2-Colorable, The distance spectral radius of digraphs, Reducing the dichromatic number via cycle reversions in infinite digraphs, Extending kernel perfect digraphs to kernel perfect critical digraphs, Coloring digraphs with forbidden cycles, Efficient computation of the oriented chromatic number of recursively defined digraphs, Colorings and spectral radius of digraphs, The dichromatic number of infinite families of circulant tournaments, On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs, Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets, The edge density of critical digraphs, The minimum feedback arc set problem and the acyclic disconnection for graphs, A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments, A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth, Eigenvalues and colorings of digraphs, Spectral radius of strongly connected digraphs, A note on coloring digraphs of large girth, Directed defective asymmetric graph coloring games, The diachromatic number of digraphs, Extension of Gyárfás-Sumner conjecture to digraphs, Majority colorings of sparse digraphs, On the growth rate of dichromatic numbers of finite subdigraphs, Algorithms for finding maximum transitive subtournaments, A semi-strong perfect digraph theorem, On the Complexity of Digraph Colourings and Vertex Arboricity, A Cvetković-type theorem for coloring of digraphs, Unnamed Item, The chromatic polynomial of a digraph, Hajós and Ore constructions for digraphs, Lightness of digraphs in surfaces and directed game chromatic number, Coloring tournaments: from local to global, Dichromatic number and forced subdivisions, Colorings in digraphs from the spectral radius, The acyclic disconnection of a digraph, Tournaments and Semicomplete Digraphs, Miscellaneous Digraph Classes, Perfect Digraphs, Some of My Favorite Coloring Problems for Graphs and Digraphs, Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded, Colouring non-even digraphs, A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number, Infinite families of -dichromatic vertex critical circulant tournaments, Relations between the Local Chromatic Number and Its Directed Version, Results on uniquely colorable digraphs, Game-perfect semiorientations of forests
Cites Work
