Intersection properties of graphs
From MaRDI portal
Publication:1175421
DOI10.1016/0012-365X(91)90118-LzbMath0739.05082OpenAlexW2014909856MaRDI QIDQ1175421
Publication date: 25 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90118-l
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing intersection classes of graphs
- A characterisation of rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Representations of chordal graphs as subtrees of a tree
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
This page was built for publication: Intersection properties of graphs