A new characterization of k-trees and some applications
From MaRDI portal
Publication:6552676
Recommendations
Cites work
- \((k+1)\)-line graphs of \(k\)-trees
- Algebraic Graph Theory
- Algorithmic graph theory and perfect graphs
- An efficient representation of chordal graphs
- Chordal graphs and their clique graphs
- Clique tree generalization and new subclasses of chordal graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- On simple characterizations of k-trees
- On the Wiener index, distance cospectrality and transmission-regular graphs
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- Perfect k‐line graphs and k‐total graphs
- Reduced clique graphs of chordal graphs
- The number of labeled k-dimensional trees
This page was built for publication: A new characterization of \(k\)-trees and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552676)