Subclasses of k-trees: characterization and recognition
From MaRDI portal
Publication:2489905
DOI10.1016/J.DAM.2005.05.021zbMATH Open1085.05060OpenAlexW2000595303MaRDI QIDQ2489905FDOQ2489905
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Title not available (Why is that?)
- On simple characterizations of k-trees
- Triangulated graphs and the elimination process
- Algorithmic Aspects of Vertex Elimination on Graphs
- Perfect k‐line graphs and k‐total graphs
- Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
- Separating subgraphs in k-trees: Cables and caterpillars
- Recursive Graphs, Recursive Labelings and Shortest Paths
Cited In (27)
- A new characterization of \(k\)-trees and some applications
- MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
- Title not available (Why is that?)
- On the structure and deficiency of \(k\)-trees with bounded degree
- On the characteristic polynomial of the power of a path
- \(k\)-separator chordal graphs: leafage and subfamilies
- Extremal problems for connected set enumeration
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
- 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
- Title not available (Why is that?)
- Characterizations of \(H\)-graphs
- A clique-difference encoding scheme for labelled \(k\)-path 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)
