Graphs of interval count two with a given partition

DOI10.1016/J.IPL.2014.04.002MaRDI QIDQ2015148zbMATH OpenOpenAlexFDO

Authors Felix Joos, Christian Löwenstein, Fabiano de S. Oliveira, Dieter Rautenbach, Jayme L. 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

graph algorithmscombinatorial problemsinterval graphinterval countunit interval graph

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(4)

• On the classes of interval graphs of limited nesting and count of lengths
• Interval orders with two interval lengths
• Semi-proper interval graphs
• On partitioning interval graphs into proper interval subgraphs and related problems

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)