A characterization of 2-tree proper interval 3-graphs (Q2249945): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59048561, #quickstatements; #temporary_batch_1706296832163 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:14, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of 2-tree proper interval 3-graphs |
scientific article |
Statements
A characterization of 2-tree proper interval 3-graphs (English)
0 references
4 July 2014
0 references
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.
0 references
interval \(p\)-graph
0 references
forbidden induced subgraphs
0 references
