| Texto completo | |
| Autor(es): |
Lemos, Manoel
;
Reid, Talmage James
;
Wu, Haidong
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | EUROPEAN JOURNAL OF COMBINATORICS; v. 32, n. 6, p. 9-pg., 2011-08-01. |
| Resumo | |
Murty, in 1971, characterized the connected binary matroids with all circuits having the same size. We characterize the connected binary matroids with circuits of two different sizes, where the largest size is odd. As a consequence of this result we obtain both Murty's result and other results on binary matroids with circuits of only two sizes. We also show that it will be difficult to complete the general case of this problem. (C) 2011 Elsevier Ltd. All rights reserved. (AU) | |
| Processo FAPESP: | 03/09925-5 - Fundamentos da ciência da computação: algoritmos combinatórios e estruturas discretas |
| Beneficiário: | Yoshiharu Kohayakawa |
| Modalidade de apoio: | Auxílio à Pesquisa - Programa PRONEX - Temático |