Characterising chordal contact \(B_0\)-VPG graphs (Q1661864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterising chordal contact Bâ‚€-VPG graphs |
scientific article; zbMATH DE number 6919940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterising chordal contact \(B_0\)-VPG graphs |
scientific article; zbMATH DE number 6919940 |
Statements
Characterising chordal contact \(B_0\)-VPG graphs (English)
0 references
17 August 2018
0 references
vertex intersection graphs
0 references
contact \(B_0\)-VPG graphs
0 references
forbidden induced subgraphs
0 references
chordal graphs
0 references
polynomial-time algorithm
0 references
0.9610726237297058
0 references
0.9066803455352784
0 references
0.8877543210983276
0 references
0.852893054485321
0 references
0.8384785056114197
0 references
