The normal graph conjecture is true for circulants

MaRDI QIDQ3424793zbMATH OpenFDO

Authors Annegret K. Wagler

Publication date 5 March 2007

zbMATH Keywords

perfect graphcyclic clique cover

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Recommendations

• Disproving the normal graph conjecture
• The normal graph conjecture for classes of sparse graphs
• The normal graph conjecture for two classes of sparse graphs
• On the odd cycles of normal graphs
• Verification of the normal graph conjecture on particular classes of graphs

Cited in

(8)

• Disproving the normal graph conjecture
• On equistable, split, CIS, and related classes of graphs
• Almost all regular graphs are normal
• Verification of the normal graph conjecture on particular classes of graphs
• Constructions for normal graphs and some consequences
• The Poincare Conjecture is True in the Product of any Graph with a Disk
• The normal graph conjecture for two classes of sparse graphs
• The normal graph conjecture for classes of sparse graphs

This page was built for publication: The normal graph conjecture is true for circulants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424793)