Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Removing circuits in 3-connected binary matroids

Full text
Author(s):
Cordovil, Raul [1] ; Maia, Jr., Braulio [2] ; Lemose, Manoel [3]
Total Authors: 3
Affiliation:
[1] Inst Super Tecn, Dept Matemat, P-1049001 Lisbon - Portugal
[2] Univ Fed Campina Grande, Unidade Acad Matemat & Estat, BR-58105305 Campina Grande, Paraiba - Brazil
[3] Univ Fed Pernambuco, Dept Matemat, BR-50740540 Recife, PE - Brazil
Total Affiliations: 3
Document type: Journal article
Source: DISCRETE MATHEMATICS; v. 309, n. 4, p. 655-665, MAR 6 2009.
Web of Science Citations: 1
Abstract

For a k-connected graph or matroid M, where k is a fixed positive integer, we say that a subset X of E(M) is k-removable provided M\textbackslash{}X is k-connected. In this paper, we obtain a sharp condition on the size of a 3-connected binary matroid to have a 3-removable circuit. (C) 2008 Elsevier B.V. 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