A characterization of 2-tree proper interval 3-graphs
From MaRDI portal
Publication:2249945
DOI10.1155/2014/143809zbMath1295.05200OpenAlexW2075276698WikidataQ59048561 ScholiaQ59048561MaRDI QIDQ2249945
Breeann M. Flesch, David E. Brown
Publication date: 4 July 2014
Published in: Journal of Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/143809
Related Items
Unnamed Item, A characterization of 2-tree proper interval 3-graphs, Interval \(k\)-graphs and orders
Cites Work
- Adjacency matrices of probe interval graphs
- Weakly triangulated graphs
- Obstacle numbers of graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- A characterization of 2-tree proper interval 3-graphs
- Interval digraphs: An analogue of interval graphs
- Indifference Digraphs: A Generalization of Indifference Graphs and Semiorders
- Interval bigraphs and circular arc graphs
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item