Clique covers and coloring problems of graphs
From MaRDI portal
(Redirected from Publication:1823258)
Recommendations
Cites work
- An extension of a theorem of the Bruijn and Erdős on combinatorial designs
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3344591 (Why is no real title available?)
- Maximum degree and fractional matchings in uniform hypergraphs
- On the chromatic index of multigraphs without large triangles
- On the combinatorial problems which I would most like to see solved
- Some applications of Vizing's theorem to vertex colorings of graphs
Cited in
(8)- Crossings, colorings, and cliques
- On the triangle clique cover and \(K_t\) clique cover problems
- Clique-transversal sets and clique-coloring in planar graphs
- Clique Covering of Graphs IV. Algorithms
- Complexity of clique-coloring odd-hole-free graphs
- Coloring the Maximal Cliques of Graphs
- scientific article; zbMATH DE number 6747335 (Why is no real title available?)
- On the equivalence covering number of splitgraphs
This page was built for publication: Clique covers and coloring problems of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823258)