Graphs of interval count two with a given partition

DOI10.1016/j.ipl.2014.04.002zbMath1370.05201OpenAlexW2060241060MaRDI QIDQ2015148

Dieter Rautenbach, Fabiano de S. Oliveira, Felix Joos, Christian Löwenstein, Jayme Luiz Szwarcfiter

Publication date: 23 June 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.04.002

zbMATH Keywords

combinatorial problemsgraph algorithmsinterval graphunit interval graphinterval count

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On the classes of interval graphs of limited nesting and count of lengths ⋮ Interval orders with two interval lengths

Cites Work

• Unit and single point interval graphs
• On counting interval lengths of interval graphs
• A linear-time algorithm for proper interval graph recognition
• Chronological orderings of interval graphs
• Interval graphs and interval orders
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• The Roberts characterization of proper and unit interval graphs
• The Interval Count of a Graph
• Realizing Interval Graphs with Size and Distance Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs of interval count two with a given partition