Some new classes of open distance-pattern uniform graphs
From MaRDI portal
Publication:2248722
DOI10.1155/2013/863439zbMath1295.05098WikidataQ58923563 ScholiaQ58923563MaRDI QIDQ2248722
Publication date: 27 June 2014
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/863439
split graphs; interval graphs; strongly chordal graphs; Ptolemaic graphs; maximal outerplanar graphs; odpu-chordal graphs; odpu-graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complement reducible graphs
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- A fast parallel algorithm to recognize P4-sparse graphs
- A Linear Recognition Algorithm for Cographs
- A characterization of ptolemaic graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Centers of maximal outerplanar graphs