Publication:2857436
From MaRDI portal
zbMath1274.05405MaRDI QIDQ2857436
Dieter Rautenbach, Jayme Luiz Szwarcfiter
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001892
05C75: Structural characterization of families of graphs
05C62: Graph representations (geometric and intersection representations, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for proper interval graph recognition
- Simple linear time recognition of unit interval graphs
- Open-interval graphs versus closed-interval graphs
- 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
- Incidence matrices, interval graphs and seriation in archeology
- Structure theorems for some circular-arc graphs
- A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
- Scheduling Interval-Ordered Tasks
- Graph Classes: A Survey
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques