On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
Journal of Combinatorial Designs · 2013-01 · 21 (2) · 60-80
DOI: 10.1002/jcd.21312 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Designs, online erschienen am 29.05.2012. Verfasst von Darryn Bryant und 2 weiteren Autor:innen. Die Arbeit wurde bisher 17-mal zitiert (Crossref) und nennt 47 Literaturangaben.
Abstract (Originalsprache)
Given two 2‐regular graphs F 1 and F 2 , both of order n , the Hamilton‐Waterloo Problem for F 1 and F 2 asks for a factorization of the complete graph into α 1 copies of F 1 , α 2 copies of F 2 , and a 1‐factor if n is even, for all nonnegative integers α 1 and α 2 satisfying . We settle the Hamilton‐Waterloo Problem for all bipartite 2‐regular graphs F 1 and F 2 where F 1 can be obtained from F 2 by replacing each cycle with a bipartite 2‐regular graph of the same order.
Zitieren
APA
Bryant, D., Danziger, P., & Dean, M. (2013). On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors. Journal of Combinatorial Designs, 21(2), 60-80. https://doi.org/10.1002/jcd.21312
Vancouver
Bryant D, Danziger P, Dean M. On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors. Journal of Combinatorial Designs. 2013;21(2):60-80. doi:10.1002/jcd.21312
BibTeX
@article{Bryant2013,
author = {Bryant, Darryn and Danziger, Peter and Dean, Matthew},
title = {On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors},
journal = {Journal of Combinatorial Designs},
year = {2013},
volume = {21},
number = {2},
pages = {60--80},
doi = {10.1002/jcd.21312}
}
EUVIMED