On cover-structure graphs

DOI10.1016/J.DAM.2009.06.033zbMATH Open1227.05154OpenAlexW2003746260MaRDI QIDQ967385FDOQ967385

Authors: 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

Recommendations

• On covers of graphs
• On covers of graphs
• On some covering graphs of a graph
• scientific article; zbMATH DE number 975337
• On total covers of graphs
• scientific article; zbMATH DE number 878334
• Publication:4484774
• Publication:4731216
• scientific article; zbMATH DE number 5248
• Graph coverings and graph labellings

zbMATH Keywords

information theorycommunication complexityperfect graphsBerge 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

• A Mathematical Theory of Communication
• Topics in Intersection Graph Theory
• On the Shannon capacity of a graph
• Title not available (Why is that?)
• The strong perfect graph theorem
• Communication Complexity
• Title not available (Why is that?)
• Square-free perfect graphs.
• The Shannon capacity of a graph and the independence numbers of its powers
• Classes of perfect graphs

Cited In (6)

• On some covering graphs of a graph
• Title not available (Why is that?)
• Covering arrays on graphs
• Covers of complete graphs and related association schemes
• Title not available (Why is that?)
• Modeling \(k\)-coteries by well-covered graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967385)