Some extremal results in cochromatic and dichromatic theory

DOI10.1002/jgt.3190150604zbMath0743.05047WikidataQ105529912 ScholiaQ105529912MaRDI QIDQ3984467

Dieter Kratsch, Paul Erdős, 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

zbMATH Keywords

clique number; perfect graph; random graph; dichromatic number; cochromatic number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C80: Random graphs (graph-theoretic aspects)

05C15: Coloring of graphs and hypergraphs

05C20: Directed graphs (digraphs), tournaments

Related Items

Coloring graphs with fixed genus and girth, Unnamed Item, Some of My Favorite Coloring Problems for Graphs and Digraphs, Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization, Two results on the digraph chromatic number, Partitioning extended \(P_4\)-laden graphs into cliques and stable sets, The dichromatic number of infinite families of circulant tournaments, Partitions of graphs into cographs, Partitioning graphs into complete and empty graphs, The acyclic disconnection of a digraph, Subcolorings and the subchromatic number of a graph, Approximating minimum cocolorings., Some defective parameters in graphs, Fixed-parameter algorithms for the cocoloring problem, Unnamed Item, DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER

Cites Work

• Unnamed Item