Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 88, 2011 - Issue 13
Submit an article Journal homepage
50
Views
0
CrossRef citations to date
0
Altmetric
Section A

Strong product of factor-critical graphs

Zefang Wu Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin, ChinaCorrespondence[email protected]
,
Xu Yang Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin, China
&
Qinglin Yu Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin, China; Department of Mathematics and Statistics, Thompson Rivers University, Kamloops, BC, Canada
Pages 2685-2696 | Received 04 Nov 2009, Accepted 13 Feb 2011, Published online: 09 Jun 2011

References

  • Edmonds , I. 1965 . Paths, trees and flowers . Can. J. Math , 17 : 449 – 467 .
  • Edmonds , J. and Johnson , E. L. 1973 . Matching, Euler tours and the Chinese postman . Math. Program , 5 : 233 – 236 .
  • Favaron , O. 1996 . On k-factor-critical graphs . Discuss. Math. Graph Theory , 16 : 41 – 51 .
  • Györi , E. and Imrich , W. 2001 . On the strong product of a k-extendable and an l-extendable graph . Graphs Combin , 17 : 245 – 253 .
  • Györi , E. and Plummer , M. D. 1992 . The Cartesian product of a k-extendable and an l-extendable graph is (k+l+1)-extendable . Discrete Math , 101 : 87 – 96 .
  • Imrich , W. and Klavžar , S. 2000 . Product Graphs: Structure and Recognition , New York : John Wiley & Sons .
  • Lovász , L. and Plummer , M. D. 1986 . Matching Theory , Amsterdam : North-Holland Inc .
  • Wattenhofer , M. and Wattenhofer , R. 2004 . Fast and simple algorithms for weighted perfect matching . Electron. Notes Discrete Math , 17 : 285 – 291 .
  • Yu , Q. L. 1993 . Characterizations of various matching extensions in graphs . Australas. J. Combin , 7 : 55 – 64 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.