Pages that link to "Item:Q3002552"
From MaRDI portal
The following pages link to One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552):
Displaying 19 items.
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- New results on Ptolemaic graphs (Q499349) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- Vulnerability of subclasses of chordal graphs (Q1742199) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Integer Laplacian eigenvalues of chordal graphs (Q2229473) (← links)
- Non-inclusion and other subclasses of chordal graphs (Q2283105) (← links)
- Block-indifference graphs: characterization, structural and spectral properties (Q2328093) (← links)
- An efficient representation of chordal graphs (Q2450661) (← links)
- Ptolemaic and planar cover-incomparability graphs (Q2665829) (← links)
- \(k\)-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
- (Q4551369) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Counting and enumerating unlabeled split–indifference graphs (Q5370830) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- Strictly chordal graphs: structural properties and integer Laplacian eigenvalues (Q6185992) (← links)
- A new characterization of \(k\)-trees and some applications (Q6552676) (← links)
- Multicore graphs: characterization and properties (Q6616809) (← links)
