A Characterization of 2-Tree Proper Interval 3-Graphs

An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-trees which are interval 3-graphs via a list of three...

Full description

Saved in:
Bibliographic Details
Published in:Journal of Discrete Mathematics 2014-02, Vol.2014, p.1-7
Main Authors: Brown, David E., Flesch, Breeann M.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-trees which are interval 3-graphs via a list of three graphs and three infinite families of forbidden induced subgraphs.
ISSN:2090-9837
2090-9845
DOI:10.1155/2014/143809