Strictly interval graphs: characterization and linear time recognition
From MaRDI portal
Publication:325435
DOI10.1016/J.ENDM.2016.03.024zbMATH Open1351.90052OpenAlexW2407722793MaRDI QIDQ325435FDOQ325435
Authors: Lilian Markenzon, Christina F. E. M. Waga 
Publication date: 18 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.024
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Algorithmic graph theory and perfect graphs
- Title not available (Why is that?)
- Representation of a finite graph by a set of intervals on the real line
- On the tree representation of chordal graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- A Characterization of Block-Graphs
- The leafage of a chordal graph
- Clique tree generalization and new subclasses of chordal graphs
- Block duplicate graphs and a hierarchy of chordal graphs
- \(k\)-separator chordal graphs: leafage and subfamilies
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- Title not available (Why is that?)
Cited In (10)
- Simple linear time recognition of unit interval graphs
- A linear time recognition algorithm for proper interval graphs
- The scattering number of strictly chordal graphs: linear time determination
- Recognizing interval bigraphs by forbidden patterns
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS
- Realizing Interval Graphs with Size and Distance Constraints
- Semi-proper interval graphs
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- Vulnerability of subclasses of chordal 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)
