Unique intersectability of diamond-free graphs

DOI10.1016/J.DAM.2011.01.012MaRDI QIDQ534340zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On uniquely intersectable graphs
• scientific article; zbMATH DE number 54774
• On the connectivity of diamond-free graphs
• scientific article; zbMATH DE number 1195742
• Isolation of the diamond graph
• On the connectivity of \(p\)-diamond-free graphs
• Triangle-free geometric intersection graphs with no large independent sets
• scientific article; zbMATH DE number 19218
• Intersection dimension and graph invariants
• Unique irredundance, domination and independent domination in graphs

Cites work

• scientific article; zbMATH DE number 572473 (Why is no real title available?)
• scientific article; zbMATH DE number 4183467 (Why is no real title available?)
• scientific article; zbMATH DE number 3049937 (Why is no real title available?)
• Complexity of representation of graphs by set systems
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On economical set representations of graphs
• On uniquely intersectable graphs
• Sur deux propriétés des classes d'ensembles
• The Representation of a Graph by Set Intersections
• Uniquely intersectable graphs

Cited in

(1)

• scientific article; zbMATH DE number 4183467 (Why is no real title available?)

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

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