A minimax theorem on circuits in projective graphs

DOI10.1016/0095-8956(81)90042-3zbMath0401.05067OpenAlexW2093048092MaRDI QIDQ1255022

Sóstenes Lins

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90042-3

zbMATH Keywords

GraphMinimaxCircuitPolynomial AlgorithmPprojective Plane

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (7)

Unnamed Item ⋮ Decomposition of graphs on surfaces ⋮ On combinatorial properties of binary spaces ⋮ Unexpected behaviour of crossing sequences ⋮ Minor-Minimal Planar Graphs of Even Branch-Width ⋮ Decomposition of graphs on surfaces and a homotopic circulation theorem ⋮ Combinatorics of orientation reversing polygons

Cites Work

• Unnamed Item
• Multicommodity flows in planar graphs
• An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container
• 2-Matchings and 2-covers of hypergraphs

This page was built for publication: A minimax theorem on circuits in projective graphs