On cover-structure graphs

DOI10.1016/j.dam.2009.06.033zbMath1227.05154OpenAlexW2003746260MaRDI QIDQ967385

Henning Wunderlich

Publication date: 28 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.033

zbMATH Keywords

information theoryperfect graphscommunication complexityBerge graphsbeautiful graphscover structure graphscs-graphsrectangle covers

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• The strong perfect graph theorem
• Square-free perfect graphs.
• Classes of perfect graphs
• The Shannon capacity of a graph and the independence numbers of its powers
• On the Shannon capacity of a graph
• Topics in Intersection Graph Theory
• Communication Complexity

This page was built for publication: On cover-structure graphs