Abstract
As a common generalization of matchings and matroid intersection, Cunningham and Geelen introduced the notion of path-matchings in 1996. Let K1,t the star with t +1 vertices. A graph is K1,t-free if G contains no K1,t as its induced subgraph. Sumner showed that (t-1)-connected K1,t-free graphs with even number of vertices have a perfect matching. In this paper, some sufficient conditions for existence of perfect path-matching of K1,t -free graphs are presented. As an immediate consequence, we improve Sumner's result.
Original language | English |
---|---|
Title of host publication | Proceedings - 2009 1st IEEE Symposium on Web Society, SWS 2009 |
Pages | 86-89 |
Number of pages | 4 |
DOIs | |
Publication status | Published - 2009 |
Externally published | Yes |
Event | 2009 1st IEEE Symposium on Web Society, SWS 2009 - Lanzhou, China Duration: 23 Aug 2009 → 24 Aug 2009 |
Publication series
Name | Proceedings - 2009 1st IEEE Symposium on Web Society, SWS 2009 |
---|
Conference
Conference | 2009 1st IEEE Symposium on Web Society, SWS 2009 |
---|---|
Country/Territory | China |
City | Lanzhou |
Period | 23/08/09 → 24/08/09 |
Fingerprint
Dive into the research topics of 'Forbidden subgraph and perfect path-matchings'. Together they form a unique fingerprint.Cite this
Yan, J., Hu, B., Zhang, H., Zhu, T., & Li, X. (2009). Forbidden subgraph and perfect path-matchings. In Proceedings - 2009 1st IEEE Symposium on Web Society, SWS 2009 (pp. 86-89). Article 5271774 (Proceedings - 2009 1st IEEE Symposium on Web Society, SWS 2009). https://doi.org/10.1109/SWS.2009.5271774