Perfect k‐line graphs and k‐total graphs
From MaRDI portal
Publication:4693345
Recommendations
Cited in
(8)- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
- Generalized line graphs: Cartesian products and complexity of recognition
- A new characterization of \(k\)-trees and some applications
- Gallai graphs and anti-Gallai graphs
- Subclasses of \(k\)-trees: characterization and recognition
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- \((k+1)\)-line graphs of \(k\)-trees
- Induced cycles in triangle graphs
This page was built for publication: Perfect k‐line graphs and k‐total graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4693345)