On the metamorphosis of a G-design into a (G-e)-design

DOI10.1016/J.DISC.2013.11.014MaRDI QIDQ394313zbMATH OpenOpenAlexFDO

Authors Matthew William Sutton

Publication date 27 January 2014

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2013.11.014

zbMATH Keywords

metamorphosiscyclic graph decompositionlabellings of graphs

Mathematics Subject Classification ID

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

Recommendations

• Metamorphosis problems for graph designs.
• The spectrum of \(\text{Meta}(K_3+e> P_4, \lambda)\) and \(\text{Meta}(K_3+e> H_4, \lambda)\) with any \(\lambda \)
• scientific article; zbMATH DE number 2076919
• A survey on the metamorphosis of some \(\lambda\)-fold \(G\)-designs
• scientific article; zbMATH DE number 1760752

Cites work

• scientific article; zbMATH DE number 1760752 (Why is no real title available?)
• scientific article; zbMATH DE number 1416058 (Why is no real title available?)
• Decompositions of complete graphs into kayak paddles
• On cyclic decompositions of complete graphs into tripartite graphs
• On diagonal cycle systems
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• On the cyclic decomposition of complete graphs into bipartite graphs
• The metamorphosis of lambda-fold block designs with block size four into lambda-fold triple systems
• Theta graphs, graph decompositions and related graph labelling techniques

Cited in

(1)

• Metamorphosis problems for graph designs.

This page was built for publication: On the metamorphosis of a \(G\)-design into a (\(G-e\))-design

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