On the odd cycles of normal graphs

DOI10.1016/S0166-218X(99)00018-9zbMath0928.05035MaRDI QIDQ1293197

Caterina De Simone, János Körner

Publication date: 2 January 2000

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

zbMATH Keywords

perfect graphstrong perfect graph conjecturenormal graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

On equistable, split, CIS, and related classes of graphs ⋮ Almost all regular graphs are normal ⋮ Line-graphs of cubic graphs are normal ⋮ The normal graph conjecture for two classes of sparse graphs ⋮ Disproving the normal graph conjecture ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Constructions for normal graphs and some consequences

Cites Work

• Entropy splitting for antiblocking corners and perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Two-step encoding for finite sources
• Unnamed Item
• Unnamed Item

This page was built for publication: On the odd cycles of normal graphs