A minimax theorem on circuits in projective graphs (Q1255022): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(81)90042-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093048092 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3216677 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multicommodity flows in planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 2-Matchings and 2-covers of hypergraphs / rank | |||
Normal rank | |||
Latest revision as of 00:33, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimax theorem on circuits in projective graphs |
scientific article |
Statements
A minimax theorem on circuits in projective graphs (English)
0 references
1981
0 references
Minimax
0 references
Graph
0 references
Circuit
0 references
Pprojective Plane
0 references
Polynomial Algorithm
0 references
0 references
