On the non-unit count of interval graphs

DOI10.1016/j.dam.2014.11.004zbMath1320.05061OpenAlexW2011218678MaRDI QIDQ496432

Rainer Schrader, Alexander Apke

Publication date: 21 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.11.004

zbMATH Keywords

intersection graphcomparability invariantinterval graphunit interval graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A characterization of interval orders with semiorder dimension two

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unit and single point interval graphs
• On counting interval lengths of interval graphs
• Chronological orderings of interval graphs
• A short proof that `proper = unit'
• A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
• Incidence matrices and interval graphs
• The Roberts characterization of proper and unit interval graphs
• Short Models for Unit Interval Graphs
• Representation of a finite graph by a set of intervals on the real line
• The Interval Count of a Graph
• Unit Interval Graphs of Open and Closed Intervals
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: On the non-unit count of interval graphs