Orthogonal double covers of complete graphs by caterpillars of diameter 5

DOI10.1007/S00373-007-0693-4zbMATH Open1120.05069OpenAlexW2036987009MaRDI QIDQ879946FDOQ879946

Dalibor Fronček

Publication date: 10 May 2007

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

Full work available at URL: https://doi.org/10.1007/s00373-007-0693-4

Recommendations

• Orthogonal double covers of complete graphs by fat caterpillars
• scientific article
• scientific article; zbMATH DE number 2186481
• Orthogonal double covers of complete graphs by lobsters of diameter 4
• Orthogonal double covers of complete graphs by trees of small diameter

zbMATH Keywords

orthogonal labeling

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Orthogonal double covers of complete graphs by trees
• On orthogonal double covers of graphs
• Orthogonal double covers of complete graphs by trees of small diameter
• Orthogonal double covers of complete graphs by lobsters of diameter 4
• On orthogonal double covers by trees

Cited In (7)

• Dihedral covers of the complete graph \(K_5\)
• Circulant double coverings of a circulant graph of valency five
• Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum end
• Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center
• Orthogonal double covers of complete graphs by fat caterpillars
• Orthogonal double covers of complete graphs by lobsters of diameter 4
• Title not available (Why is that?)

This page was built for publication: Orthogonal double covers of complete graphs by caterpillars of diameter 5

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