Clique covers and coloring problems of graphs
type: Item
instance of: scholarly article
title: Clique covers and coloring problems of graphs
zbMATH Open document ID: 0681.05041
DOI: 10.1016/0095-8956(89)90053-1
author: Walter Klotz
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 4114672
zbMATH Keywords: covering problems
zbMATH Keywords: upper bounds
zbMATH Keywords: chromatic index
zbMATH Keywords: clique covers
zbMATH Keywords: chromatic number
zbMATH Keywords: coloring problems
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90053-1
OpenAlex ID: W1967955642
cites work: Q3686719
cites work: On the combinatorial problems which I would most like to see solved
cites work: Q3853641
cites work: Maximum degree and fractional matchings in uniform hypergraphs
cites work: Q5572939
cites work: Some applications of Vizing's theorem to vertex colorings of graphs
cites work: On the chromatic index of multigraphs without large triangles
cites work: Q5620610
cites work: An extension of a theorem of the Bruijn and Erdős on combinatorial designs
description: scientific article; zbMATH DE number 4114672