Largest bipartite subgraphs in triangle-free graphs with maximum degree three (Q3749084)
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 3985263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Largest bipartite subgraphs in triangle-free graphs with maximum degree three |
scientific article; zbMATH DE number 3985263 |
Statements
Largest bipartite subgraphs in triangle-free graphs with maximum degree three (English)
0 references
1986
0 references
forbidden subgraph
0 references
bipartite graph
0 references
maximum bipartite subgraph
0 references
polynomial algorithm
0 references
0.8642386198043823
0 references
0.8588511347770691
0 references
0.8572341799736023
0 references
0.8461014628410339
0 references
0.8282071948051453
0 references
