ProV Logo
0

Disproving the normal graph conjecture
Harutyunyan, Ararat...
Disproving the normal graph conjecture by Harutyunyan, Ararat ( Author )
N.A
22-08-2015
A graph G is called normal if there exist two coverings, C and S of its vertex set such that every member of C induces a clique in G, every member of S induces an independent set in G and C∩S≠∅ for every C∈C and S∈S. It has been conjectured by De Simone and Körner in 1999 that a graph G is normal if G does not contain C5, C7 and C7¯¯¯¯¯¯ as an induced subgraph. We disprove this conjecture.
-
Article
pdf
36.88 KB
English
-
MYR 0.00
-
http://arxiv.org/abs/1508.05487
Share this eBook