The normal graph conjecture is true for minimal unbreakable graphs

MaRDI QIDQ3090705zbMATH OpenFDO

Authors Mihai Talmaciu

Publication date 31 August 2011

zbMATH Keywords

normal graphrecognition algorithmunbreakable graphweakly decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Communication networks in operations research (90B18)

Recommendations

• Verification of the normal graph conjecture on particular classes of graphs
• The normal graph conjecture for two classes of sparse graphs
• The normal graph conjecture for classes of sparse graphs
• On partitionable, confidentially connected and unbreakable graphs
• Disproving the normal graph conjecture

Cited in

(4)

• Disproving the normal graph conjecture
• Almost all regular graphs are normal
• On partitionable, confidentially connected and unbreakable graphs
• The normal graph conjecture for two classes of sparse graphs

This page was built for publication: The normal graph conjecture is true for minimal unbreakable graphs

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