Perfect graphs and graph entropy: An updated survey
From MaRDI portal
Recommendations
Cited in
(29)- Constructions for normal graphs and some consequences
- Minimum entropy coloring
- Perfect couples of graphs
- Reconstructing unrooted phylogenetic trees from symbolic ternary metrics
- The normal graph conjecture for two classes of sparse graphs
- Linear extensions and comparable pairs in partial orders
- Probabilistic refinement of the asymptotic spectrum of graphs
- Information theoretic parameters of noncommutative graphs and convex corners
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
- Disproving the normal graph conjecture
- Three-way symbolic tree-maps and ultrametrics
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth
- Line-graphs of cubic graphs are normal
- Perfection, imperfection, and graph entropy
- Rainbow saturation and graph capacities
- Randomly colouring graphs (a combinatorial view)
- scientific article; zbMATH DE number 780788 (Why is no real title available?)
- Symmetric graphs with respect to graph entropy
- scientific article; zbMATH DE number 7204408 (Why is no real title available?)
- An axiomatic duality framework for the theta body and related convex corners
- Cross‐intersecting couples of graphs
- Communication Lower Bounds Via the Chromatic Number
- Graph pairs and their entropies: Modularity problems
- Generalizing Körner's graph entropy to graphons
- A history of graph entropy measures
- Entropy splitting for antiblocking corners and perfect graphs
- Entropy of symmetric graphs
- Structural information content of networks: graph entropy based on local vertex functionals
This page was built for publication: Perfect graphs and graph entropy: An updated survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758342)
