Unique intersectability of diamond-free graphs
From MaRDI portal
Publication:534340
DOI10.1016/J.DAM.2011.01.012zbMATH Open1228.05216OpenAlexW2111818637MaRDI QIDQ534340FDOQ534340
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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- On uniquely intersectable graphs
- Sur deux propriétés des classes d'ensembles
- The Representation of a Graph by Set Intersections
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Complexity of representation of graphs by set systems
- Uniquely intersectable graphs
- On economical set representations of graphs
- Title not available (Why is that?)
Cited In (1)
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)
