Perfect Matchings in Claw-free Cubic Graphs
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Oum, Sang-il | ko |
| dc.date.accessioned | 2013-03-09T22:15:58Z | - |
| dc.date.available | 2013-03-09T22:15:58Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2011-03 | - |
| dc.identifier.citation | ELECTRONIC JOURNAL OF COMBINATORICS, v.18, no.1 | - |
| dc.identifier.issn | 1077-8926 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/97623 | - |
| dc.description.abstract | Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2(cn) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve and planar graphs by Chudnovsky and Seymour. We prove that every claw-free cubic n-vertex graph with no cutedge has more than 2(n/12) perfect matchings, thus verifying the conjecture for claw-free graphs. | - |
| dc.language | English | - |
| dc.publisher | ELECTRONIC JOURNAL OF COMBINATORICS | - |
| dc.title | Perfect Matchings in Claw-free Cubic Graphs | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000288697500002 | - |
| dc.identifier.scopusid | 2-s2.0-79955736170 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 18 | - |
| dc.citation.issue | 1 | - |
| dc.citation.publicationname | ELECTRONIC JOURNAL OF COMBINATORICS | - |
| dc.contributor.localauthor | Oum, Sang-il | - |
| dc.description.isOpenAccess | Y | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- 18469.pdf(91.59 kB)Download
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 5 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.