Almost all regular graphs are normal

In 1999, De Simone and Körner conjectured that every graph without induced C5,C7,C¯7 contains a clique cover C and a stable set cover I such that every clique in C and every stable set in I have a vertex in common. This conjecture has roots in information theory and became known as the Normal Graph...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2017-10, Vol.230, p.51-55
Hauptverfasser:	Changiz Rezaei, Seyed Saeed, Hosseini, Seyyed Aliasghar, Mohar, Bojan
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied mathematics Graph entropy Graphs Information theory Normal Graph Conjecture Random regular graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!