A Characterization of 2-Tree Proper Interval 3-Graphs

Autor:	David E. Brown, Breeann Flesch
Rok vydání:	2014
Předmět:	Discrete mathematics Combinatorics Indifference graph Intersection Computer Science::Information Retrieval Interval graph Nested intervals Interval (graph theory) Characterization (mathematics) Intersection graph Tree (graph theory) MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Journal of Discrete Mathematics. 2014:1-7
ISSN:	2090-9845 2090-9837
DOI:	10.1155/2014/143809
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::58ad3967f50a3530ced662377f3f18c8 https://doi.org/10.1155/2014/143809 Zobrazit plný text záznamu Plný text