Largest bipartite subgraphs in triangle-free graphs with maximum degree three (Q3749084): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:20, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Largest bipartite subgraphs in triangle-free graphs with maximum degree three |
scientific article |
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
