Integral mixed unit interval graphs

Authors:
Van Bang Le;Dieter Rautenbach
Affiliations:
Institut für Informatik, Universität Rostock, Rostock, Germany;Institut für Optimierung und Operations Research, Universität Ulm, Ulm, Germany
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 10
Cited 0

Open-interval graphs versus closed-interval graphs

Discrete Mathematics
Simple linear time recognition of unit interval graphs

Information Processing Letters
A linear-time algorithm for proper interval graph recognition

Information Processing Letters
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques

SIAM Journal on Computing
Graph classes: a survey

Graph classes: a survey
The ultimate interval graph recognition algorithm?

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Linear Time Algorithm for Deciding Interval Graph Isomorphism

Journal of the ACM (JACM)
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

SIAM Journal on Computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a linear-time algorithm that decides if a given interval graph admits such an intersection representation.