Some extremal results in cochromatic and dichromatic theory
From MaRDI portal
Publication:3984467
DOI10.1002/jgt.3190150604zbMath0743.05047OpenAlexW2052457163WikidataQ105529912 ScholiaQ105529912MaRDI QIDQ3984467
Dieter Kratsch, John G. Gimbel
Publication date: 27 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190150604
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (23)
On the dichromatic number of surfaces ⋮ The digrundy number of digraphs ⋮ Partitions of graphs into cographs ⋮ Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization ⋮ Oriented list colorings of graphs ⋮ Two results on the digraph chromatic number ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Subcolorings and the subchromatic number of a graph ⋮ Some defective parameters in graphs ⋮ DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER ⋮ Fixed-parameter algorithms for the cocoloring problem ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets ⋮ Coloring graphs with fixed genus and girth ⋮ The dichromatic number of infinite families of circulant tournaments ⋮ Advances on defective parameters in graphs ⋮ The diachromatic number of digraphs ⋮ The chromatic polynomial of a digraph ⋮ Unnamed Item ⋮ The acyclic disconnection of a digraph ⋮ Partitioning graphs into complete and empty graphs ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Approximating minimum cocolorings. ⋮ Fractional cocoloring of graphs
Cites Work
This page was built for publication: Some extremal results in cochromatic and dichromatic theory
