On the Classes of Interval Graphs of Limited Nesting and Count of Lengths
From MaRDI portal
Publication:4636528
DOI10.4230/LIPIcs.ISAAC.2016.45zbMath1398.68246arXiv1510.03998OpenAlexW2962735809MaRDI QIDQ4636528
Pavel Klavík, Yota Otachi, Jiří Šejnoha
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1510.03998
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (6)
Succinct encodings for families of interval graphs ⋮ Extending partial representations of interval graphs ⋮ On the thinness and proper thinness of a graph ⋮ 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
This page was built for publication: On the Classes of Interval Graphs of Limited Nesting and Count of Lengths