Unit interval graphs: a story with open ends
From MaRDI portal
Recommendations
Cites work
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A linear-time algorithm for proper interval graph recognition
- A short proof that `proper = unit'
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Algorithmic graph theory and perfect graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Incidence matrices, interval graphs and seriation in archeology
- Open-interval graphs versus closed-interval graphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Scheduling Interval-Ordered Tasks
- Simple linear time recognition of unit interval graphs
- Structure theorems for some circular-arc graphs
Cited in
(9)- Open-interval graphs versus closed-interval graphs
- On the unit interval number of a graph
- On properties of unit interval graphs with a perceptual motivation
- scientific article; zbMATH DE number 3943869 (Why is no real title available?)
- Classes of interval graphs under expanding length restrictions
- scientific article; zbMATH DE number 1156662 (Why is no real title available?)
- Unit interval graphs of open and closed intervals
- A Note on Candeal and Induráin’s Semiorder Separability Condition
- A characterization of unit interval bigraphs of open and closed intervals
This page was built for publication: Unit interval graphs: a story with open ends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857436)
