The matching extension problem in general graphs is co-NP-complete

Jan Hackfeld () and Arie M. C. A. Koster ()
Additional contact information
Jan Hackfeld: Humboldt-Universität zu Berlin
Arie M. C. A. Koster: RWTH Aachen University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 3, No 11, 853-859

Abstract: Abstract A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with $$0

Keywords: Graph theory; Complexity; Perfect matching; Extendability (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0226-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:3:d:10.1007_s10878-017-0226-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0226-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().