Recognizing graphic matroids
- P. D. Seymour
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
There is no polynomially bounded algorithm to test if a matroid (presented by an “independence oracle”) is binary. However, there is one to test graphicness. Finding this extends work of previous authors, who have given algorithms to test binary matroids for graphicness. Our main tool is a new result that ifM′ is the polygon matroid of a graphG, andM is a different matroid onE(G) with the same rank, then there is a vertex ofG whose star is not a cocircuit ofM.
- R. E. Bixby andW. H. Cunningham, Converting linear programs to network problems,Math. Operations Res., to appear.
- D. A. Higgs, Strong maps of geometries,J. Combinatorial Theory 5 (1968), 185–191.
- P. M. Jensen andB. Korte, Complexity of matroid property algorithms,Univ. of Bonn Tech. Report No. 78124-0R
- L. Lovász, The matroid matching problem, inAlgebraic Methods in Graph Theory, Proc. Coll. Math. Soc. J. Bolyai, North-Holland 1980.
- G. C. Robinson andD. J. A. Welsh, The computational complexity of matroid properties,to appear.
- W. T. Tutte, An algorithm for determining whether a given binary matroid is graphic,Proc. Amer. Math. Soc. 11 (1960), 905–917. CrossRef
- D. J. A. Welsh,Matroid Theory, London Math. Soc. Monograph 8, Academic Press, 1976.
- Recognizing graphic matroids
Volume 1, Issue 1 , pp 75-78
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- 05 B 35
- 68 C 25
- Industry Sectors
- P. D. Seymour (1) (2)
- Author Affiliations
- 1. Merton College, Oxford, England
- 2. University of Waterloo, Waterloo, Ontario, Canada