Resolvable coverings of 2-paths by cycles

DOI10.1007/S003730200059zbMATH Open1009.05037OpenAlexW2077763930MaRDI QIDQ1865626FDOQ1865626

Authors: Midori Kobayashi, Gisaku Nakamura 

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

Recommendations

• Resolvable coverings of 2-paths by 4-cycles
• scientific article; zbMATH DE number 169440
• Exact coverings of 2-paths by 4-cycles
• Exact coverings of 2-paths by Hamilton cycles
• scientific article; zbMATH DE number 4061294
• Cycle covers of planar 2-edge-connected graphs
• Uniform coverings of 2-paths with 4-cycles
• On cycle covers of graphs with bounded pathwidth
• Double coverings of 2‐paths by Hamilton cycles*
• Covering a subset with two cycles

zbMATH Keywords

Dudeney's round table problem

Mathematics Subject Classification ID

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

Cited In (6)

• Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking
• Title not available (Why is that?)
• Black 1-factors and Dudeney sets
• On diagonal cycle systems
• Resolvable coverings of 2-paths by 4-cycles
• Uniform coverings of 2-paths in the complete graph and the complete bipartite graph

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)