Unique intersectability of diamond-free graphs

DOI10.1016/j.dam.2011.01.012zbMath1228.05216OpenAlexW2111818637MaRDI QIDQ534340

Yue-Li Wang, Tao-Ming Wang, Jun-Lin Guo

Publication date: 17 May 2011

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

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

zbMATH Keywords

clique partitiondiamond-free graphsset representationuniquely intersectable

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of representation of graphs by set systems
• Uniquely intersectable graphs
• On uniquely intersectable graphs
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• The Representation of a Graph by Set Intersections
• Sur deux propriétés des classes d'ensembles

This page was built for publication: Unique intersectability of diamond-free graphs