Theta graphs, graph decompositions and related graph labelling techniques

DOI10.1017/S0004972700034377zbMath1090.05503OpenAlexW2161124079MaRDI QIDQ4470205

Andrew Blinco

Publication date: 22 June 2004

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700034377

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions III: Complete graphs and fixed length cycles

This page was built for publication: Theta graphs, graph decompositions and related graph labelling techniques