Pages that link to "Item:Q1348383"
From MaRDI portal
The following pages link to Clique tree generalization and new subclasses of chordal graphs (Q1348383):
Displaying 20 items.
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms (Q608275) (← links)
- Two methods for the generation of chordal graphs (Q940844) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- A linear-time algorithm for isomorphism of a subclass of chordal graphs (Q1195864) (← links)
- Vulnerability of subclasses of chordal graphs (Q1742199) (← links)
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
- Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
- Block-indifference graphs: characterization, structural and spectral properties (Q2328093) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Graphs that have clique (partial) 2-trees (Q2375850) (← links)
- An efficient representation of chordal graphs (Q2450661) (← links)
- A unified framework for bi(tri)connectivity and chordal augmentation (Q2841986) (← links)
- \(k\)-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
- Tree 3-Spanner in 2-sep Chordal Graphs: Characterization, Recognition, and Construction. (Q3439541) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- A new characterization of \(k\)-trees and some applications (Q6552676) (← links)
