Properly Colored Hamiltonian Paths in 2-Edge-Colored Complete Bipartite Graphs
Properly colored subgraphs, in which no two adjacent edges share the same color, play a central role in the study of edge-colored graphs. A classical result establishes that a 2-edge-colored complete graph contains a properly colored Hamiltonian path if and only if it admits a properly colored 1-path-cycle factor. This...