A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
Work
Year: 2017
Type: article
Abstract: The Hamilton–Waterloo problem asks for which s and r the complete graph can be decomposed into s copies of a given 2‐factor F 1 and r copies of a given 2‐factor F 2 (and one copy of a 1‐factor if n i... more
Source: Journal of Combinatorial Designs
Authors Melissa Keranen, Adrián Pastine
Institution Michigan Technological University
Cites: 15
Cited by: 12
Related to: 10
FWCI: 1.062
Citation percentile (by year/subfield): 63.77
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green