Multidesigns for the graph pair formed by the 6-cycle and 3-prism
Given two graphs G and H, a (G,H)-multidecomposition of Kn is a partition of the edges of Kn into copies of G and H such that at least one copy of each is used. We give necessary and sufficient conditions for the existence of (C6,Ċ6)-multidecomposition of Kn where C6 denotes a cycle of length 6 and...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | , |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2020-04-01.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |