Perfect couples of graphs
From MaRDI portal
Recommendations
Cites work
- A note on perfect graphs
- Entropy splitting for antiblocking corners and perfect graphs
- Fredman–Komlós bounds and information theory
- Graphs that Split Entropies
- Lambda composition
- Normal hypergraphs and the perfect graph conjecture
- Relaxations of vertex packing
- Transitiv orientierbare Graphen
- Two-step encoding for finite sources
Cited in
(17)- Perfect graphs and graph entropy: An updated survey
- Counting Gallai 3-colorings of complete graphs
- Some bounds of weighted entropies with augmented Zagreb index edge weights
- Information theoretic parameters of noncommutative graphs and convex corners
- Gallai colorings and domination in multipartite digraphs
- Disconnected colors in generalized Gallai-colorings
- Graph pairs and their entropies: Modularity problems
- The number of Gallai k-colorings of complete graphs
- Complete edge-colored permutation graphs
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Gallai colorings of non-complete graphs
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Constructions for normal graphs and some consequences
- Symmetric graphs with respect to graph entropy
- Probabilistic refinement of the asymptotic spectrum of graphs
- Entropy of symmetric graphs
- Extremal problems and results related to Gallai-colorings
This page was built for publication: Perfect couples of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196687)