论文信息 - Dyck's map (3, 7)8 is a counterexample to a clique covering conjecture

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

Abstract Let c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A counterexample is provided to a conjecture communicated by P. Erdős. If c(G − e)

A. Vince | Steve Wilson

[1] Walther Dyck. Ueber Aufstellung und Untersuchung von Gruppe und Irrationalität regulärer Riemann'scher Flächen , 1880 .

[2] H. Coxeter,et al. Generators and relations for discrete groups , 1957 .

[3] H. S. M. Coxeter,et al. The abstract groups , 1939 .