On the odd cycles of normal graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3453665 (Why is no real title available?)
- Entropy splitting for antiblocking corners and perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Two-step encoding for finite sources
Cited in
(13)- Disproving the normal graph conjecture
- On equistable, split, CIS, and related classes of graphs
- Line-graphs of cubic graphs are normal
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- Almost all regular graphs are normal
- Verification of the normal graph conjecture on particular classes of graphs
- On digraphs with the odd cycle property
- Constructions for normal graphs and some consequences
- Minimal normal graph covers
- The normal graph conjecture for two classes of sparse graphs
- Normal hypergraphs and the perfect graph conjecture. (Reprint)
- The normal graph conjecture is true for circulants
- The normal graph conjecture for classes of sparse graphs
This page was built for publication: On the odd cycles of normal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293197)