The Normal Graph Conjecture for Classes of Sparse Graphs

DOI10.1007/978-3-642-45043-3_7zbMath1419.05088OpenAlexW14386397MaRDI QIDQ2864291

Anne Berry, Annegret K. Wagler

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_7

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)

Related Items (4)

On equistable, split, CIS, and related classes of graphs ⋮ Line-graphs of cubic graphs are normal ⋮ The normal graph conjecture for two classes of sparse graphs ⋮ Disproving the normal graph conjecture

This page was built for publication: The Normal Graph Conjecture for Classes of Sparse Graphs