| Full text | |
| Author(s): |
Lemos, Manoel
[1]
Total Authors: 1
|
| Affiliation: | [1] Univ Fed Pernambuco, Dept Matemat, BR-50740540 Recife, PE - Brazil
Total Affiliations: 1
|
| Document type: | Journal article |
| Source: | ADVANCES IN APPLIED MATHEMATICS; v. 42, n. 1, p. 75-81, JAN 2009. |
| Web of Science Citations: | 5 |
| Abstract | |
In this paper, we settle a conjecture made by Wu. We show that a 3-connected binary matroid M is graphic if and only if each element avoids exactly r(M) - 1 non-separating cocircuits of M. This result is a natural companion to the following theorem of Bixby and Cunningham: a 3-connected binary matroid M is graphic if and only if each element belongs to exactly 2 non-separating cocircuits of M. (C) 2008 Elsevier Inc. All rights reserved. (AU) | |
| FAPESP's process: | 03/09925-5 - Foundations of computer science: combinatory algorithms and discrete structures |
| Grantee: | Yoshiharu Kohayakawa |
| Support Opportunities: | PRONEX Research - Thematic Grants |