Graphs of interval count two with a given partition

DOI10.1016/J.IPL.2014.04.002zbMATH Open1370.05201OpenAlexW2060241060MaRDI QIDQ2015148FDOQ2015148

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

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

Recommendations

• On counting interval lengths of interval graphs
• On partitioning interval graphs into proper interval subgraphs and related problems
• LATIN 2004: Theoretical Informatics
• Interval graph representation with given interval and intersection lengths
• Interval graph representation with given interval and intersection lengths

zbMATH Keywords

graph algorithmscombinatorial problemsinterval graphinterval countunit interval graph

Mathematics Subject Classification ID

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

Cites Work

• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• Title not available (Why is that?)
• Interval graphs and interval orders
• A linear-time algorithm for proper interval graph recognition
• Chronological orderings of interval graphs
• Title not available (Why is that?)
• The Roberts characterization of proper and unit interval graphs
• The Interval Count of a Graph
• Unit and single point interval graphs
• On counting interval lengths of interval graphs
• Realizing Interval Graphs with Size and Distance Constraints
• On representing an interval graph using the minimum number of interval lengths

Cited In (3)

• On the classes of interval graphs of limited nesting and count of lengths
• Interval orders with two interval lengths
• Semi-proper interval graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015148)