Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 87, 2010 - Issue 8
Submit an article Journal homepage
47
Views
1
CrossRef citations to date
0
Altmetric
Section A

Algorithms for (0, 1, d)-graphs with d constrains

Yueping Li School of Electronics and Information Engineering, Shenzhen Polytechnic Shenzhen, Guangdong, 518055, P.R. China; Department of Computer Science, Sun Yat-sen University, Guangzhou, 510275, P.R. ChinaCorrespondence[email protected]
,
Dingjun Lou Department of Computer Science, Sun Yat-sen University, Guangzhou, 510275, P.R. China
&
Yunting Lu Shenzhen Institute of Information Technology, Shenzhen, 518029, P.R. China
Pages 1680-1691 | Received 07 Sep 2007, Accepted 14 Oct 2008, Published online: 22 Jul 2009

References

  • Aldred , R. , Holton , D. , Lou , D. and Saito , A. 2003 . M-alternating paths in n-extendable bipartite graphs . Discrete Math. , 269 : 1 – 11 .
  • Carvalho , M. H. and Cheriyan , J. 2005 . An O(VE) algorithm for ear decompositions of matching-covered graphs . ACM Trans. Algorithms , 1 : 324 – 337 .
  • Gabow , H. N. and Jordan , T. 2000 . How to make a square grid framework with cables rigid . SIAM J. Comput. , 30 : 649 – 680 .
  • Jin , Z. , Yan , H. and Yu , Q. 2007 . Generalization of matching extensions in graphs (II) . Discrete Appl. Math. , 155 : 1267 – 1274 .
  • Li , Y. and Lou , D. A new algorithm for determinating 1-extendable graphs: design and implementation . Proceedings of International Multiconference of Engineers and Computer Scientists . March 21–23 , Hong Kong, China. pp. 2327 – 2332 . Hong Kong : Newswood Limited .
  • Li , Y. and Lou , D. Matching extendability augmentation in bipartite graphs . Proceedings of International Multiconference of Engineers and Computer Scientists . March 21–23 , Hong Kong, China. pp. 2291 – 2296 . Hong Kong : Newswood Limited .
  • Li , Y. and Lou , D. Finding the (n, k, 0)-extendability in bipartite graphs and its application . Proceedings of International Conference on Computational Science . May 27–31 2007 , Beijing, China. pp. 401 – 409 . Lect. Notes Comput. Sci. 4489
  • Liu , G. and Yu , Q. 2001 . Generlization of matching extensions in graphs . Discrete Math. , 231 : 311 – 320 .
  • Lou , D. , Saito , A. and Teng , L. 2005 . A note on internally disjoint alternating paths in bipartite graphs . Discrete Math. , 290 : 105 – 108 .
  • Plummer , M. 1980 . On n-extendable graphs . Discrete Math. , 31 : 201 – 210 .
  • Plummer , M. 1996 . Extending matchings in graphs: an update . Congr. Numer , 116 : 3 – 32 .
  • Plummer , M. 2004 . Extending matchings in graphs: a survey . Discrete Math. , 127 : 277 – 292 .
  • Wen , X. and Lou , D. 2007 . Characterizing defect n-extendable bipartite graphs with different connectivities . Discrete Math. , 307 : 1898 – 1908 .
  • Zhang , F. and Zhang , H. 2006 . Construction for bicritical graphs and k-extendable bipartite graphs . Discrete Math. , 306 : 1415 – 1423 .

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.