Perfect Matchings in Claw-free Cubic Graphs

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 437
  • Download : 164
DC FieldValueLanguage
dc.contributor.authorOum, Sang-ilko
dc.date.accessioned2013-03-09T22:15:58Z-
dc.date.available2013-03-09T22:15:58Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2011-03-
dc.identifier.citationELECTRONIC JOURNAL OF COMBINATORICS, v.18, no.1-
dc.identifier.issn1077-8926-
dc.identifier.urihttp://hdl.handle.net/10203/97623-
dc.description.abstractLovasz 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.languageEnglish-
dc.publisherELECTRONIC JOURNAL OF COMBINATORICS-
dc.titlePerfect Matchings in Claw-free Cubic Graphs-
dc.typeArticle-
dc.identifier.wosid000288697500002-
dc.identifier.scopusid2-s2.0-79955736170-
dc.type.rimsART-
dc.citation.volume18-
dc.citation.issue1-
dc.citation.publicationnameELECTRONIC JOURNAL OF COMBINATORICS-
dc.contributor.localauthorOum, Sang-il-
dc.description.isOpenAccessY-
dc.type.journalArticleArticle-
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 webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0