Clique-perfectness of complements of line graphs (Q5891101)
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 6190264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique-perfectness of complements of line graphs |
scientific article; zbMATH DE number 6190264 |
Statements
Clique-perfectness of complements of line graphs (English)
0 references
23 July 2013
0 references
clique-transversal number
0 references
clique-independence number
0 references
clique-perfect graphs
0 references
edge-coloring
0 references
line graphs
0 references
maximal matchings
0 references
minimal forbidden induced subgraphs
0 references
0 references
0 references
0.9040898680686952
0 references
0.8606246709823608
0 references
0.8538035750389099
0 references
0.8537667393684387
0 references
