Largest bipartite subgraphs in triangle-free graphs with maximum degree three (Q3749084): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3959417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pentagon-Generated Trivalent Graphs with Girth 5 / rank | |||
Normal rank | |||
Latest revision as of 18:11, 17 June 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
