Double coverings of 2‐paths by Hamilton cycles * | Zendy

Kobayashi Midori | Zendy; Mutoh Nobuaki | Zendy; Nakamura Gisaku | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Double coverings of 2‐paths by Hamilton cycles *

Author(s) -

Kobayashi Midori,

Mutoh Nobuaki,

Nakamura Gisaku

Publication year - 2002

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.10003

Subject(s) - multiset , combinatorics , mathematics , path (computing) , hamiltonian path , set (abstract data type) , graph , computer science , programming language

A double Dudeney set in K n is a multiset of Hamilton cycles in K n having the property that each 2‐path in K n lies in exactly two of the cycles. A double Dudeney set in K n has been constructed when n ≥ 4 is even. In this paper, we construct a double Dudeney set in K n when n ≥ 3 is odd. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 195–206, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ) DOI 10.1002/jcd.10003

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research