Constructions for normal graphs and some consequences

DOI10.1016/J.DAM.2008.05.021MaRDI QIDQ1003480zbMATH OpenOpenAlexFDO

Authors Annegret K. Wagler

Publication date 4 March 2009

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2008.05.021

zbMATH Keywords

perfect graphsimperfection rationormal graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3887730 (Why is no real title available?)
• scientific article; zbMATH DE number 3453665 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Entropy splitting for antiblocking corners and perfect graphs
• Graph imperfection. I
• Graphs that Split Entropies
• Normal hypergraphs and the perfect graph conjecture
• On certain polytopes associated with graphs
• On the odd cycles of normal graphs
• Perfect couples of graphs
• Perfect graphs and graph entropy: An updated survey
• Sur le coloriage des graphs
• The normal graph conjecture is true for circulants
• The strong perfect graph theorem
• Two-step encoding for finite sources

Cited in

(6)

• On equistable, split, CIS, and related classes of graphs
• Almost all regular graphs are normal
• Normal polytopes arising from finite graphs
• Normal form of domishold graphs
• The normal graph conjecture for two classes of sparse graphs
• On determining the imperfection ratio

This page was built for publication: Constructions for normal graphs and some consequences

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