Characterisations of Intersection Graphs by Vertex Orderings

Details Characterisations of Intersection Graphs by Vertex Orderings Characterisations of Intersection Graphs by Vertex Orderings

2004-04-14

arxiv.org/abs/cs/0404031v1

Australasian J. Combinatorics 34:261-268, 2006

Computer Science

Discrete Mathematics

submitted

Scientific paper

Characterisations of interval graphs, comparability graphs, co-comparability
graphs, permutation graphs, and split graphs in terms of linear orderings of
the vertex set are presented. As an application, it is proved that interval
graphs, co-comparability graphs, AT-free graphs, and split graphs have
bandwidth bounded by their maximum degree.

Affiliated with

Also associated with

No associations

Rating

Characterisations of Intersection Graphs by Vertex Orderings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterisations of Intersection Graphs by Vertex Orderings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterisations of Intersection Graphs by Vertex Orderings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9820