Perfect couples of graphs

DOI10.1007/BF01204721zbMath0778.05071OpenAlexW1998069195MaRDI QIDQ1196687

János Körner, Gábor Simonyi, Zsolt Tuza

Publication date: 16 January 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01204721

zbMATH Keywords

probability distributionperfect graphsgraph entropy

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (15)

Information theoretic parameters of noncommutative graphs and convex corners ⋮ Complete edge-colored permutation graphs ⋮ Entropy of symmetric graphs ⋮ On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems ⋮ Extremal problems and results related to Gallai-colorings ⋮ Symmetric graphs with respect to graph entropy ⋮ Gallai colorings and domination in multipartite digraphs ⋮ Gallai colorings of non-complete graphs ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Constructions for normal graphs and some consequences ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ Counting Gallai 3-colorings of complete graphs ⋮ The number of Gallai \(k\)-colorings of complete graphs ⋮ Disconnected Colors in Generalized Gallai-Colorings

Cites Work

• Entropy splitting for antiblocking corners and perfect graphs
• Relaxations of vertex packing
• A note on perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Graphs that Split Entropies
• Fredman–Komlós bounds and information theory
• Lambda composition
• Two-step encoding for finite sources
• Transitiv orientierbare Graphen

This page was built for publication: Perfect couples of graphs