Orthogonal double covers of complete graphs by caterpillars of diameter 5

DOI10.1007/S00373-007-0693-4zbMath1120.05069OpenAlexW2036987009MaRDI QIDQ879946

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

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 of small diameter
• Orthogonal double covers of complete graphs by trees
• On orthogonal double covers by trees
• On orthogonal double covers of graphs
• Unnamed Item

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