Strictly interval graphs: characterization and linear time recognition

DOI10.1016/j.endm.2016.03.024zbMath1351.90052OpenAlexW2407722793MaRDI QIDQ325435

Lilian Markenzon, Christina Fraga Esteves Maciel Waga

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.024

zbMATH Keywords

recognitionstrictly chordal graphsstrictly interval graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (2)

The scattering number of strictly chordal graphs: linear time determination ⋮ Vulnerability of subclasses of chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Clique tree generalization and new subclasses of chordal graphs
• Block duplicate graphs and a hierarchy of chordal graphs
• Algorithmic graph theory and perfect graphs
• k-separator chordal graphs: leafage and subfamilies
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Polynomial-Time Algorithm for the Leafage of Chordal Graphs
• On the tree representation of chordal graphs
• A Characterization of Block-Graphs
• The leafage of a chordal graph
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Strictly interval graphs: characterization and linear time recognition