The dichromatic number of a digraph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3918396 (Why is no real title available?)
- scientific article; zbMATH DE number 3687449 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- The structure of k-chromatic graphs
Cited in
(only showing first 100 items - show all)- Lightness of digraphs in surfaces and directed game chromatic number
- On kernel-perfect critical digraphs
- Uniquely colourable m-dichromatic oriented graphs
- On constructive methods in the theory of colour-critical graphs
- Extending kernel perfect digraphs to kernel perfect critical digraphs
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
- The acyclic disconnection of a digraph
- The 3 and 4-dichromatic tournaments of minimum order
- Vertex critical 4-dichromatic circulant tournaments
- On the achromatic number of signed graphs
- Spectral radius of strongly connected digraphs
- The diachromatic number of digraphs
- Game-perfect digraphs
- A note on coloring digraphs of large girth
- Extension of Gyárfás-Sumner conjecture to digraphs
- Majority colorings of sparse digraphs
- A Cvetković-type theorem for coloring of digraphs
- The chromatic polynomial of a digraph
- Dichromatic number and forced subdivisions
- Colorings in digraphs from the spectral radius
- 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
- Game-perfect semiorientations of forests
- Cycles in color-critical graphs
- On the dichromatic number of surfaces
- The dichromatic polynomial of a digraph
- Chordal directed graphs are not \(\chi\)-bounded
- The digrundy number of digraphs
- On extremal spectral results of digraphs based on sum distance
- Colorings of oriented planar graphs avoiding a monochromatic subgraph
- The minimum number of edges in 4-critical digraphs of given order
- Reducing the dichromatic number via cycle reversions in infinite digraphs
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- On the growth rate of dichromatic numbers of finite subdigraphs
- Hajós and Ore constructions for digraphs
- Coloring tournaments: from local to global
- Infinite quasi-transitive digraphs with domination number 2
- A flow theory for the dichromatic number
- Disproof of a conjecture of Neumann-Lara
- Spectral radius of digraphs with given dichromatic number
- The distance spectral radius of digraphs
- Achromatic numbers for circulant graphs and digraphs
- The NL-flow polynomial
- Decomposing and colouring some locally semicomplete digraphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Finding good 2-partitions of digraphs. I. Hereditary properties
- Dichromatic number and fractional chromatic number
- Planar digraphs of digirth five are 2-colorable
- Tournaments and Semicomplete Digraphs
- Miscellaneous digraph classes
- Bounds for the dichromatic number of a generalized lexicographic product of digraphs
- Towards a flow theory for the dichromatic number
- Dichromatic polynomial of product digraphs
- Equality perfect graphs and digraphs
- Colourings, homomorphisms, and partitions of transitive digraphs
- Infinite families of -dichromatic vertex critical circulant tournaments
- On a Conjecture of Víctor Neumann-Lara
- Two results on the digraph chromatic number
- On the acyclic disconnection of multipartite tournaments
- Coloring digraphs with forbidden cycles
- scientific article; zbMATH DE number 1444491 (Why is no real title available?)
- A semi-strong perfect digraph theorem
- Colorings and spectral radius of digraphs
- Results on uniquely colorable digraphs
- The dichromatic number of infinite families of circulant tournaments
- Heroes in orientations of chordal graphs
- Digraphs and variable degeneracy
- scientific article; zbMATH DE number 7250143 (Why is no real title available?)
- On the complexity of digraph colourings and vertex arboricity
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
- The edge density of critical digraphs
- Perfect digraphs
- The minimum feedback arc set problem and the acyclic disconnection for graphs
- Relations between the local chromatic number and its directed version
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
- Planar digraphs of digirth four are 2-colorable
- Some of my favorite coloring problems for graphs and digraphs
- Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas
- Strong complete minors in digraphs
- Algorithms for finding maximum transitive subtournaments
- Complete directed minors and chromatic number
- On coloring digraphs with forbidden induced subgraphs
- The smallest 5-chromatic tournament
- Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number
- Tutte polynomials for regular oriented matroids
- Four proofs of the directed Brooks' theorem
- Various bounds on the minimum number of arcs in a k-dicritical digraph
- Acyclic coloring of products of digraphs
- Digraph redicolouring
- The A_ spectral moments of digraphs with a given dichromatic number
- On inducing degenerate sums through 2-labellings
- 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₄
- 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
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al..
- Coloring \(k\)-partite sparse digraphs
- On spectral properties of digraphs about maximum distance
This page was built for publication: The dichromatic number of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836671)