Premium
Nondisconnecting disentanglements of amalgamated 2‐factorizations of complete multipartite graphs
Author(s) -
Leach C. D.,
Rodger C. A.
Publication year - 2001
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.1024
Subject(s) - mathematics , combinatorics , multipartite , factorization , graph , class (philosophy) , discrete mathematics , algorithm , computer science , artificial intelligence , physics , quantum mechanics , quantum entanglement , quantum
In this paper necessary and sufficient conditions are found for an edge‐colored graph H to be the homomorphic image of a 2‐factorization of a complete multipartite graph G in which each 2‐factor of G has the same number of components as its corresponding color class in H . This result is used to completely solve the problem of finding hamilton decompositions of K a,b − E ( U ) for any 2‐factor U of K a,b . © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 460–467, 2001