Title
Linear Orderings of Subfamilies of AT-Free Graphs
Abstract
Asteroidal triple free (AT-free) graphs have been introduced as a generalization of interval graphs, since interval graphs are exactly the chordal AT-free graphs. While for interval graphs it is obvious that there is always a linear ordering of the vertices, such that for each triple of independent vertices the middle one intercepts any path between the remaining vertices of the triple, it is not clear that such an ordering exists for AT-free graphs in general. In this paper we study graphs that are defined by enforcing such an ordering. In particular, we introduce two subfamilies of AT-free graphs, namely, path orderable graphs and strong asteroid free graphs. Path orderable graphs are defined by a linear ordering of the vertices that is a natural generalization of the ordering that characterizes cocomparability graphs. On the other hand, motivation for the definition of strong asteroid free graphs comes from the fundamental work of Gallai on comparability graphs. We show that cocomparability graphs $\subset$ path orderable graphs $\subset$ strong asteroid free graphs $\subset$ AT-free graphs. In addition, we settle the recognition question for the two new classes by proving that recognizing path orderable graphs is NP-complete, whereas the recognition problem for strong asteroid free graphs can be solved in polynomial time.
Year
DOI
Venue
2006
10.1137/S0895480104445307
SIAM J. Discrete Math.
Keywords
Field
DocType
at-free graphs,recognition algorithm,interval graph,at-free graph,complexity,asteroidal triple free graphs,natural generalization,path orderable graph,strong asteroid free graph,graph algorithms,chordal at-free graph,cocomparability graph,recognition question,recognition problem,linear ordering,comparability graph,linear orderings,polynomial time,linear order
Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Clique-sum,Cograph,Pathwidth,Longest path problem,Mathematics,Trapezoid graph,Maximal independent set
Journal
Volume
Issue
ISSN
20
1
0895-4801
Citations 
PageRank 
References 
5
0.44
3
Authors
4
Name
Order
Citations
PageRank
Derek G. Corneil11397218.67
Köhler Ekkehard242039.30
Stephan Olariu32252166.46
Lorna Stewart436128.05