Clique covers and coloring problems of graphs

DOI10.1016/0095-8956(89)90053-1zbMath0681.05041OpenAlexW1967955642MaRDI QIDQ1823258

Walter Klotz

Publication date: 1989

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(89)90053-1

zbMATH Keywords

upper boundschromatic numberchromatic indexcovering problemscoloring problemsclique covers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

On the equivalence covering number of splitgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic index of multigraphs without large triangles
• On the combinatorial problems which I would most like to see solved
• Maximum degree and fractional matchings in uniform hypergraphs
• Some applications of Vizing's theorem to vertex colorings of graphs
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs

This page was built for publication: Clique covers and coloring problems of graphs