On the non-unit count of interval graphs
From MaRDI portal
Publication:496432
DOI10.1016/J.DAM.2014.11.004zbMATH Open1320.05061OpenAlexW2011218678MaRDI QIDQ496432FDOQ496432
Authors: Alexander Apke, Rainer Schrader 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Representation of a finite graph by a set of intervals on the real line
- A Characterization of Comparability Graphs and of Interval Graphs
- Short models for unit interval graphs
- Title not available (Why is that?)
- Unit interval graphs of open and closed intervals
- Chronological orderings of interval graphs
- A short proof that `proper = unit'
- 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
Cited In (7)
- A note on the unit interval number and proper interval number of graphs.
- On counting interval lengths of interval graphs
- A characterization of interval orders with semiorder dimension two
- Open-interval graphs versus closed-interval graphs
- Interval count of generalizations of threshold graphs
- On representing an interval graph using the minimum number of interval lengths
- On unit interval graphs with integer endpoints
This page was built for publication: On the non-unit count of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496432)
