| dc.creator | Fujita, S | |
| dc.creator | Kawarabayashi, K | |
| dc.creator | Lucchesi, CL | |
| dc.creator | Ota, K | |
| dc.creator | Plummer, MD | |
| dc.creator | Saito, A | |
| dc.date | 2006 | |
| dc.date | MAY | |
| dc.date | 2014-11-15T04:46:50Z | |
| dc.date | 2015-11-26T16:30:55Z | |
| dc.date | 2014-11-15T04:46:50Z | |
| dc.date | 2015-11-26T16:30:55Z | |
| dc.date.accessioned | 2018-03-28T23:11:59Z | |
| dc.date.available | 2018-03-28T23:11:59Z | |
| dc.identifier | Journal Of Combinatorial Theory Series B. Academic Press Inc Elsevier Science, v. 96, n. 3, n. 315, n. 324, 2006. | |
| dc.identifier | 0095-8956 | |
| dc.identifier | WOS:000237476800001 | |
| dc.identifier | 10.1016/j.jctb.2005.08.002 | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/76607 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/76607 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/76607 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1270085 | |
| dc.description | In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let W be a set of connected graphs. each of which has three or more vertices. A graph G is said to be H-free if no graph in W is ail induced subgraph of G. We completely characterize the set H such that every connected H-free graph of sufficiently large even order has a perfect matching in the following cases. (1) Every graph in R is triangle-free. (2) H consists of two graphs (i.e. a pair of forbidden subgraphs). A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H-free graph of sufficiently large odd order has a near-perfect matching in the above cases. (C) 2005 Elsevier Inc. All rights reserved. | |
| dc.description | 96 | |
| dc.description | 3 | |
| dc.description | 315 | |
| dc.description | 324 | |
| dc.language | en | |
| dc.publisher | Academic Press Inc Elsevier Science | |
| dc.publisher | San Diego | |
| dc.publisher | EUA | |
| dc.relation | Journal Of Combinatorial Theory Series B | |
| dc.relation | J. Comb. Theory Ser. B | |
| dc.rights | fechado | |
| dc.rights | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
| dc.source | Web of Science | |
| dc.subject | perfect matching | |
| dc.subject | near-perfect matching | |
| dc.subject | forbidden subgraph | |
| dc.title | A pair of forbidden subgraphs and perfect matchings | |
| dc.type | Artículos de revistas | |
