Clique tree generalization and new subclasses of chordal graphs
From MaRDI portal
Publication:1348383
DOI10.1016/S0166-218X(00)00336-XzbMATH Open0999.05017OpenAlexW2087220179WikidataQ127664744 ScholiaQ127664744MaRDI QIDQ1348383FDOQ1348383
Authors: P. Sreenivasa Kumar, C. E. Veni Madhavan 
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00336-x
Recommendations
Cites Work
- Title not available (Why is that?)
- Incidence matrices and interval graphs
- Trees with Hamiltonian square
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- On the tree representation of chordal graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Dominating Sets in Chordal Graphs
- Counting clique trees and computing perfect elimination schemes in parallel
- Power of Natural Semijoins
- A characterisation of rigid circuit graphs
- Generating the maximum spanning trees of a weighted graph
- On double and multiple interval graphs
- Separating subgraphs in k-trees: Cables and caterpillars
- Title not available (Why is that?)
- Minimal vertex separators of chordal graphs
- Fast Parallel Algorithms for Chordal Graphs
- A linear-time algorithm for isomorphism of a subclass of chordal graphs
Cited In (23)
- A new characterization of \(k\)-trees and some applications
- Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction.
- Block-indifference graphs: characterization, structural and spectral properties
- Tree-structured graphs
- A unified framework for bi(tri)connectivity and chordal augmentation
- \(k\)-separator chordal graphs: leafage and subfamilies
- Linear-time algorithms for tree root problems
- Title not available (Why is that?)
- A linear time recognition algorithm for proper interval graphs
- A generalization of chordal graphs and the maximum clique problem
- Clique trees of infinite locally finite chordal graphs
- On basic chordal graphs and some of its subclasses
- Reduced clique graphs of chordal graphs
- An efficient representation of chordal graphs
- Non-inclusion and other subclasses of chordal graphs
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Graphs that have clique (partial) 2-trees
- Intersection graphs of non-crossing paths
- Strictly interval graphs: characterization and linear time recognition
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- A linear-time algorithm for isomorphism of a subclass of chordal graphs
- Two methods for the generation of chordal graphs
- Vulnerability of subclasses of chordal graphs
This page was built for publication: Clique tree generalization and new subclasses of chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348383)
