Abstract
AbstractWe construct highly edge‐connected ‐regular graphs of even order which do not contain pairwise disjoint perfect matchings. When is a multiple of 4, the result solves a problem of Thomassen [4].
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have