Resolvable coverings of 2-paths by cycles

DOI10.1007/S003730200059zbMATH Open1009.05037OpenAlexW2077763930MaRDI QIDQ1865626

Gisaku Nakamura, Midori Kobayashi

Publication date: 27 March 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200059

zbMATH Keywords

Dudeney's round table problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of packing and covering (05B40)

Related Items (1)

Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Uniform coverings of 2-paths with 4-cycles 👍 👎
• Exact coverings of 2-paths by 4-cycles 👍 👎
• Resolvable coverings of 2-paths by 4-cycles 👍 👎
• Exact coverings of 2-paths by Hamilton cycles 👍 👎
• Cycle covers of planar 2-edge-connected graphs 👍 👎
• Covering a subset with two cycles 👍 👎
• Double coverings of 2‐paths by Hamilton cycles* 👍 👎

This page was built for publication: Resolvable coverings of 2-paths by cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865626)