Making a \(K_4\)-free graph bipartite (Q950329)
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 5355867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making a \(K_4\)-free graph bipartite |
scientific article; zbMATH DE number 5355867 |
Statements
Making a \(K_4\)-free graph bipartite (English)
0 references
22 October 2008
0 references
bipartite graphs
0 references
0 references
0.89983237
0 references
0.8707893
0 references
0.8683009
0 references
0.86172736
0 references
0.86056495
0 references
0.8605648
0 references
0 references
0.8500483
0 references
