Strictly interval graphs: characterization and linear time recognition
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A Characterization of Block-Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Algorithmic graph theory and perfect graphs
- Block duplicate graphs and a hierarchy of chordal graphs
- Clique tree generalization and new subclasses of chordal graphs
- On the tree representation of chordal graphs
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- Representation of a finite graph by a set of intervals on the real line
- The leafage of a chordal graph
- \(k\)-separator chordal graphs: leafage and subfamilies
Cited in
(10)- The scattering number of strictly chordal graphs: linear time determination
- Semi-proper interval graphs
- Realizing Interval Graphs with Size and Distance Constraints
- A linear time recognition algorithm for proper interval graphs
- Vulnerability of subclasses of chordal graphs
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- Recognizing interval bigraphs by forbidden patterns
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
- Simple linear time recognition of unit interval graphs
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
This page was built for publication: Strictly interval graphs: characterization and linear time recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325435)
