A note on perfectly orderable graphs
From MaRDI portal
Publication:1917281
DOI10.1016/0166-218X(95)00042-PzbMath0858.05095OpenAlexW1977997947MaRDI QIDQ1917281
Publication date: 31 March 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(95)00042-p
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Which claw-free graphs are perfectly orderable?
- On rigid circuit graphs
- On the complexity of recognizing perfectly orderable graphs
- Characterizations of strongly chordal graphs
- A note on perfect orders
- New properties of perfectly orderable graphs and strongly perfect graphs
- A charming class of perfectly orderable graphs
- Characterizations of totally balanced matrices
- Totally-Balanced and Greedy Matrices
- Doubly Lexical Orderings of Matrices
- Four classes of perfectly orderable graphs
This page was built for publication: A note on perfectly orderable graphs