Abstract
The problem of determining whether a graph has a Hamilton cycle is NP-complete whereas there exists a polynomial algorithm to determine whether a graph has a perfect 2-matching. These two problems are related to the question of determining whether a graph has a perfect triangle-free 2-matching. We give a polynomial algorithm to answer this question and to find a perfect triangle-free 2-matching if one exists.
This work was supported in part by NSF grant ENG-7902506 and the National Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974).
G. Cornuéjols and W. Pulleyblank, “A matching problem with side conditions”, Discrete Mathematics 29 (1980) 135–159.
J. Edmonds, “Maximum matching and polyhedron with 0–1 vertices”, Journal of Research of the National Bureau of Standards 69b (1965) 125–130.
R.M. Karp, “Reducibility among combinatorial problems”, in: R.E. Miller and J.W. Thatcher, eds., Complexity of computer computations (Plenum Press, New York) pp. 85–103.
C.H. Papadimitriou, Private communication (1978).
W.T. Tutte, “The factors of graphs”, Canadian Journal of Mathematics 4 (1952) 314–328.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 The Mathematical Programming Society
About this chapter
Cite this chapter
Cornuejols, G., Pulleyblank, W.R. (1980). Perfect triangle-free 2-matchings. In: Rayward-Smith, V.J. (eds) Combinatorial Optimization II. Mathematical Programming Studies, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120901
Download citation
DOI: https://doi.org/10.1007/BFb0120901
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00803-0
Online ISBN: 978-3-642-00804-7
eBook Packages: Springer Book Archive