On the graphic matroid parity problem

Authors:
Zoltán Szigeti
Affiliations:
Equipe Combinatoire, Université Paris 6, 4 Place Jussieu, Couloir 45-46, 3e Paris 75252, Cedex 05, France
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

Citing 1
Cited 2

Finding a maximum-genus graph imbedding

Journal of the ACM (JACM)

Min-power strong connectivity

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Algebraic algorithms for linear matroid parity problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A relatively simple proof is presented for the min-max theorem of Lovász on the graphic matroid parity problem.