Theta graphs, graph decompositions and related graph labelling techniques

DOI10.1017/S0004972700034377zbMath1141.05331OpenAlexW2161124079MaRDI QIDQ5710214

Andrew Blinco

Publication date: 2 December 2005

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)

Related Items (2)

On the metamorphosis of a \(G\)-design into a (\(G-e\))-design ⋮ Inequalities for doubly nonnegative functions

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