A new characterization of \(k\)-trees and some applications

DOI10.1007/s40314-024-02707-5MaRDI QIDQ6552676

Lilian Markenzon, Cybele T. M. Vinagre, Allana S. S. de Oliveira

Publication date: 10 June 2024

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-treeblock graph\(k\)-line graphreduced clique graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Enumeration in graph theory (05C30) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduced clique graphs of chordal graphs
• Counting clique trees and computing perfect elimination schemes in parallel
• Clique tree generalization and new subclasses of chordal graphs
• On simple characterizations of k-trees
• Algorithmic graph theory and perfect graphs
• On \((k+1)\)-line graphs of \(k\)-trees and their nullities
• On the Wiener index, distance cospectrality and transmission-regular graphs
• An efficient representation of chordal graphs
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• Algebraic Graph Theory
• Perfect k‐line graphs and k‐total graphs
• The number of labeled k-dimensional trees
• Chordal graphs and their clique graphs

This page was built for publication: A new characterization of \(k\)-trees and some applications