Largest bipartite subgraphs in triangle-free graphs with maximum degree three (Q3749084): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190100407 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2109041494 / rank | |||
Normal rank | |||
Revision as of 14:29, 19 March 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
