Publication Date
2-23-2014
Abstract
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.
Publisher
Hindawi Publishing Corporation
Type (DCMI Terms)
Text
Type
Article
Department
Mathematics
Journal
Journal of Discrete Mathematics
Volume Number
2014
Issue Number
143809
First Page Number
1
Last Page Number
7
DOI
10.1155/2014/143809
Recommended Citation
David E. Brown and Breeann M. Flesch, “A Characterization of 2-Tree Proper Interval 3-Graphs,” Journal of Discrete Mathematics, vol. 2014, Article ID 143809, 7 pages, 2014. doi:10.1155/2014/143809
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
PDF/A Version