scholarly journals A characterization of 2-tree probe interval graphs

2014 ◽  
Vol 34 (3) ◽  
pp. 509
Author(s):  
David E. Brown ◽  
Breeann M. Flesch ◽  
J. Richard Lundgren
2009 ◽  
Vol 157 (4) ◽  
pp. 762-767 ◽  
Author(s):  
David E. Brown ◽  
J. Richard Lundgren ◽  
Li Sheng

1999 ◽  
Vol Vol. 3 no. 4 ◽  
Author(s):  
Andrzej Proskurowski ◽  
Jan Arne Telle

International audience We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs. We initiate a graph-theoretic study of subgraphs of q-proper interval graphs with maximum clique size k+1 and give an equivalent characterization of these graphs by restricted path-decomposition. By allowing the parameter q to vary from 0 to k, we obtain a nested hierarchy of graph families, from graphs of bandwidth at most k to graphs of pathwidth at most k. Allowing both parameters to vary, we have an infinite lattice of graph classes ordered by containment.


2014 ◽  
Vol 79 (4) ◽  
pp. 267-281 ◽  
Author(s):  
Felix Joos

Algorithmica ◽  
2006 ◽  
Vol 47 (1) ◽  
pp. 27-51 ◽  
Author(s):  
Andreas Brandstadt ◽  
Feodor F. Dragan ◽  
Hoang-Oanh Le ◽  
Van Bang Le ◽  
Ryuhei Uehara

1998 ◽  
Vol 88 (1-3) ◽  
pp. 315-324 ◽  
Author(s):  
F.R. McMorris ◽  
Chi Wang ◽  
Peisen Zhang

2005 ◽  
Vol 150 (1-3) ◽  
pp. 216-231 ◽  
Author(s):  
Nataša Pržulj ◽  
Derek G. Corneil

Sign in / Sign up

Export Citation Format

Share Document