Clique coverings and claw-free graphs
From MaRDI portal
Publication:2189831
DOI10.1016/j.ejc.2020.103114zbMath1442.05172arXiv1608.07686OpenAlexW3013599711MaRDI QIDQ2189831
Akbar Davoodi, Zsolt Tuza, Ervin Gyoeri, Csilla Bujtás
Publication date: 16 June 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.07686
Related Items
Regarding two conjectures on clique and biclique partitions, On clique coverings of complete multipartite graphs
Cites Work
- Unnamed Item
- Pairwise balanced designs and sigma clique partitions
- On rigid circuit graphs
- The Erdős-Lovász tihany conjecture for quasi-line graphs
- Proof of a conjecture of Katona and Tarjan
- Complexity of representation of graphs by set systems
- Claw-free graphs---a survey
- Extremal clique coverings of complementary graphs
- A survey of Nordhaus-Gaddum type relations
- Graphe représentatif des aretes d'un multigraphe
- Packing triangles in a graph and its complement
- On Complementary Graphs
- Local Clique Covering of Claw-Free Graphs
- On a problem of G. O. H. Katona and T. Tarján
- On the Decomposition of Graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
