Abstract: A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations.
Cited in
(42)- Unit and proper tube orders
- Random generation and enumeration of bipartite permutation graphs
- Uniform embeddings for Robinson similarity matrices
- Powers of cycles, powers of paths, and distance graphs
- Short models for unit interval graphs
- On some subclasses of interval catch digraphs
- Minimal classes of graphs of unbounded clique-width
- Extended formulations for order polytopes through network flows
- Any-order online interval selection
- Unit interval vertex deletion: fewer vertices are relevant
- On characterizing proper max-point-tolerance graphs
- Online interval scheduling: Randomized and multiprocessor cases
- Subgraph isomorphism in graph classes
- Combining overlap and containment for gene assembly in ciliates
- Graphs with at most two moplexes
- Some remarks on the geodetic number of a graph
- Tractabilities and intractabilities on geometric intersection graphs
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s
- Random Generation and Enumeration of Proper Interval Graphs
- Toric rings arising from vertex cover ideals
- Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
- A characterization of unit interval bigraphs of open and closed intervals
- Precoloring extension on unit interval graphs
- Improved randomized online scheduling of intervals and jobs
- Declawing a graph: polyhedra and branch-and-cut algorithms
- On rectangle intersection graphs with stab number at most two
- On the non-unit count of interval graphs
- Quasimonotone graphs
- The Roberts characterization of proper and unit interval graphs
- Recognizing unit multiple interval graphs is hard
- Unit representation of semiorders. I: Countable sets
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- Mixed unit interval graphs
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Canonical antichains of unit interval and bipartite permutation graphs
- Defensive domination in proper interval graphs
- Unit interval graphs: a story with open ends
- A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
- Sortable simplicial complexes and \(t\)-independence ideals of proper interval graphs
- On sum coloring and sum multi-coloring for restricted families of graphs
- A matrix characterization of interval and proper interval graphs
- Unit interval graphs of open and closed intervals
This page was built for publication: A short proof that `proper = unit'
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301726)
