Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)

DOI10.1016/0012-365X(94)00026-FzbMath0861.05054MaRDI QIDQ1923506

Yanyan Li

Publication date: 13 November 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

labelingregular graphsgraph decompositiongraceful

Mathematics Subject Classification ID

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

Related Items (1)

The gracefulness of the join of graphs

Cites Work

• Decompositions of regular bipartite graphs
• The Oberwolfach problem and factors of uniform odd length cycles
• On sequential labelings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\)