Dyck's map \(\{3,7\}_ 8\) is a counterexample to a clique covering conjecture

DOI10.1016/0095-8956(92)90074-8zbMath0708.05050OpenAlexW2057158192MaRDI QIDQ920116

Andrew Vince, Stephen E. Wilson

Publication date: 1992

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(92)90074-8

zbMATH Keywords

cliquesedge cover

Mathematics Subject Classification ID

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

Cites Work

• The Abstract Groups G m,n,p
• Unnamed Item