Abstract
Let G = (V, E) be an edge-colored graph. A matching of G is called heterochromatic if its any two edges have different colors. Unlike uncolored matchings for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is NP-complete. This means that to find both sufficient and necessary good conditions for the existence of perfect heterochromatic matchings should be not easy. In this paper, we obtain sufficient conditions of Hall-type and Tutte-type for the existence of perfect heterochromatic matchings in colored bipartite graphs and general colored graphs. We also obtain a sufficient and necessary condition of Berge-type to verify if a heterochromatic matching M of G is maximum.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Jiang, T., Miller, Z., Pritikin, D.: Properly Colored Subgraphs and Rainbow Subgraphs in Edge-Colored Graphs with Local Constraints. Random Struct. Algorithoms 23(4), 409–433 (2003)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London, Elsevier, New York (1976)
Broersma, H.J., Li, X., Wöginger, G., Zhang, S.: Paths and Cycles in Colored Graphs. Australasian J. Combin. 31, 299–312 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractabilty. Freeman, New York (1979)
Jamison, R., Jiang, T., Ling, A.: Constrained Ramsey Numbers of Graphs. J. Graph Theory 42(1), 1–16 (2003)
Jin, Z., Li, X.: The Complexity for Partitioning Graphs by Monochromatic Trees, Cycles and Paths. Intern. J. Computer Math. 81(11), 1357–1362 (2004)
Lawler, E.L: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York, Montreal Que., London (1976)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hu, L., Li, X. (2007). Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-70666-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70665-6
Online ISBN: 978-3-540-70666-3
eBook Packages: Computer ScienceComputer Science (R0)