Algorithms for (0, 1,d)-graphs withdconstrains

DOI10.1080/00207160802562523zbMath1215.05188OpenAlexW2067121839MaRDI QIDQ5747711

Dingjun Lou, Yunting Lu, Yueping Li

Publication date: 14 September 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802562523

zbMATH Keywords

algorithmsmatchingaugmentationextendabilitystrong connectivity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• On n-extendable graphs
• Extending matchings in graphs: A survey
• \(M\)-alternating paths in \(n\)-extendable bipartite graphs
• A note on internally disjoint alternating paths in bipartite graphs
• Generalization of matching extensions in graphs. II.
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs
• An O ( VE ) algorithm for ear decompositions of matching-covered graphs
• How to Make a Square Grid Framework with Cables Rigid
• Generalization of matching extensions in graphs

This page was built for publication: Algorithms for (0, 1,d)-graphs withdconstrains