On Restrictions of Balanced 2-Interval Graphs

DOI10.1007/978-3-540-74839-7_6zbMath1141.68528arXiv0704.1571OpenAlexW1805397736WikidataQ58172973 ScholiaQ58172973MaRDI QIDQ3508554

Stéphane Vialette, Philippe Gambette

Publication date: 1 July 2008

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.1571

zbMATH Keywords

schedulingbioinformaticsclaw-free graphsline graphsgraph classescircular interval graphsquasi-line graphs2-interval graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs

This page was built for publication: On Restrictions of Balanced 2-Interval Graphs