Premium
Regular matroid decomposition via signed graphs
Author(s) -
Geelen Jim,
Gerards Bert
Publication year - 2005
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20037
Subject(s) - matroid , mathematics , combinatorics , graphic matroid , oriented matroid , discrete mathematics , matroid partitioning , weighted matroid
The key to Seymour's Regular Matroid Decomposition Theorem is his result that each 3‐connected regular matroid with no R 10 ‐ or R 12 ‐minor is graphic or cographic. We present a proof of this in terms of signed graphs. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom