Subclasses of k-trees: characterization and recognition

DOI10.1016/J.DAM.2005.05.021MaRDI QIDQ2489905zbMATH OpenOpenAlexFDO

Authors Lilian Markenzon, Claudia Justel, N. Paciornik

Publication date 28 April 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.05.021

zbMATH Keywords

algorithmscliques

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

Recommendations

• k-paths of k-trees
• scientific article; zbMATH DE number 4103086
• A characterization of partial 3-trees
• On a characterization of \(k\)-trees.
• scientific article; zbMATH DE number 4094838

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Graph Classes: A Survey
• Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
• On simple characterizations of k-trees
• Perfect k‐line graphs and k‐total graphs
• Recursive Graphs, Recursive Labelings and Shortest Paths
• Separating subgraphs in k-trees: Cables and caterpillars
• Triangulated graphs and the elimination process

Cited in

(27)

• On the structure and deficiency of k-trees with bounded degree
• scientific article; zbMATH DE number 3841909 (Why is no real title available?)
• A new characterization of \(k\)-trees and some applications
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• On the characteristic polynomial of the power of a path
• \(k\)-separator chordal graphs: leafage and subfamilies
• A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
• Extremal problems for connected set enumeration
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• On \((k+1)\)-line graphs of \(k\)-trees and their nullities
• \(k\)-cographs are Kruskalian
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• Interval colourable orientations of graphs
• On the Wiener index, distance cospectrality and transmission-regular graphs
• Non-inclusion and other subclasses of chordal graphs
• How to count \(k\)-paths
• An improved planar graph product structure theorem
• Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture
• k-paths of k-trees
• Generating and counting unlabeled \(k\)-path graphs
• \((k+1)\)-line graphs of \(k\)-trees
• Graphs whose vertices of degree at least 2 lie in a triangle
• On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• scientific article; zbMATH DE number 4103086 (Why is no real title available?)
• Characterizations of \(H\)-graphs
• Separating subgraphs in k-trees: Cables and caterpillars

This page was built for publication: Subclasses of \(k\)-trees: characterization and recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489905)