Which \(k\)-trees are cover-incomparability graphs? (Q2440118)
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: Which k-trees are cover-incomparability graphs? |
scientific article; zbMATH DE number 6275001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Which \(k\)-trees are cover-incomparability graphs? |
scientific article; zbMATH DE number 6275001 |
Statements
Which \(k\)-trees are cover-incomparability graphs? (English)
0 references
27 March 2014
0 references
poset
0 references
cover-incomparability graph
0 references
chordal graph
0 references
simplicial vertex
0 references
\(k\)-tree
0 references
0.8069016337394714
0 references
0.8062975406646729
0 references
0.8059273958206177
0 references
0.7927075624465942
0 references
0.7871749997138977
0 references
