Minimal Obstructions for Partial Representations of Interval Graphs
From MaRDI portal
Publication:2942647
DOI10.1007/978-3-319-13075-0_32zbMath1435.05147arXiv1406.6228OpenAlexW2963400223MaRDI QIDQ2942647
Publication date: 11 September 2015
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.6228
Related Items
Extending partial representations of interval graphs ⋮ Minimal obstructions for partial representations of interval graphs ⋮ On the classes of interval graphs of limited nesting and count of lengths ⋮ Extending partial representations of proper and unit interval graphs ⋮ Extending partial representations of subclasses of chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Extending partial representations of proper and unit interval graphs
- Chronological orderings of interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A Kuratowski-type theorem for planarity of partially embedded graphs
- Incidence matrices and interval graphs
- Extending partial representations of interval graphs
- Incidence matrices, interval graphs and seriation in archeology
- Extending Partial Representations of Circle Graphs
- Bounded Representations of Interval and Proper Interval Graphs
- Extending Partial Representations of Function Graphs and Permutation Graphs
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
- Representation of a finite graph by a set of intervals on the real line
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
- Extending Partial Representations of Subclasses of Chordal Graphs
- ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
