A characterization of 2-tree proper interval 3-graphs (Q2249945)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6313257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of 2-tree proper interval 3-graphs |
scientific article; zbMATH DE number 6313257 |
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
0 references
0.8235423564910889
0 references
0.8089686036109924
0 references
0.8035739660263062
0 references
0.7809504270553589
0 references
0.7809504270553589
0 references
