(k+1)-line graphs of k-trees
From MaRDI portal
Publication:6072029
Recommendations
Cites work
- \(k\)-Wiener index of a \(k\)-plex
- A characterization of block graphs
- A Characterization of Block-Graphs
- A new proof of the Szeged-Wiener theorem
- An upper bound on Wiener indices of maximal planar graphs
- Distance in graphs
- scientific article; zbMATH DE number 4103086 (Why is no real title available?)
- scientific article; zbMATH DE number 3765830 (Why is no real title available?)
- scientific article; zbMATH DE number 809164 (Why is no real title available?)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- On acyclic simplicial complexes
- On metric properties of certain clique graphs
- Perfect k‐line graphs and k‐total graphs
- Properties and characterizations of k ‐trees
- Subclasses of \(k\)-trees: characterization and recognition
- The number of labeled k-dimensional trees
- The Szeged and the Wiener index of graphs
- Wiener indices of maximal \(k\)-degenerate graphs
Cited in
(2)
This page was built for publication: \((k+1)\)-line graphs of \(k\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072029)