The normal graph conjecture for two classes of sparse graphs

DOI10.1007/s00373-017-1868-2zbMath1382.05039OpenAlexW2781165376WikidataQ123003097 ScholiaQ123003097MaRDI QIDQ1706428

Annegret K. Wagler, Anne Berry

Publication date: 22 March 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1868-2

zbMATH Keywords

cacti1-treesnormal graph conjecture

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Entropy splitting for antiblocking corners and perfect graphs
• The strong perfect graph theorem
• Constructions for normal graphs and some consequences
• On the odd cycles of normal graphs
• Disproving the normal graph conjecture
• The Normal Graph Conjecture for Classes of Sparse Graphs
• Graphs that Split Entropies
• Algorithmic Aspects of Vertex Elimination on Graphs
• Almost all Berge Graphs are Perfect
• Two-step encoding for finite sources

This page was built for publication: The normal graph conjecture for two classes of sparse graphs