Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4381 LNCS, Issue , 2007, Pages 47-58

  Hu, Lin ^a   Li, Xueliang ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; TOPOLOGY; TRAJECTORIES;

BIPARTITE GRAPHS; COLORED GRAPHS; COMBINATORICS; DISCRETE GEOMETRY; EDGE-COLORED GRAPHS; MATCHING PROBLEMS; MATCHINGS; MAXIMUM MATCHING; NP-COMPLETE; POLYNOMIAL-TIME; SUFFICIENT AND NECESSARY CONDITION; SUFFICIENT CONDITIONS; TIANJIN , CHINA;

GRAPH THEORY;

EID: 49949108948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70666-3_6     Document Type: Conference Paper

References (7)

1. 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) (2003) 409-433
2. Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, Macmillan, London, Elsevier, New York (1976)
3. Broersma, H.J., Li, X., Wöginger, G., Zhang, S.: Paths and Cycles in Colored Graphs, Australasian J. Combin. 31 (2005) 299-312
4. Garey, M.R., Johnson, D.S.: Computers and Intractabilty, Freeman, New York (1979)
5. Jamison, R., Jiang, T., Ling, A.: Constrained Ramsey Numbers of Graphs. J. Graph Theory 42 (1) (2003) 1-16
6. Jin, Z., Li, X.The Complexity for Partitioning Graphs by Monochromatic Trees, Cycles and Paths. Intern. J. Computer Math. 81 (11) (2004) 1357-1362
7. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York-Montreal Que.-London (1976)