On cyclic G-designs where G is a cubic tripartite graph
From MaRDI portal
Publication:658053
DOI10.1016/J.DISC.2011.09.017zbMATH Open1233.05180OpenAlexW2142389724MaRDI QIDQ658053FDOQ658053
Authors: Wannasiri Wannasit, S. I. El-Zanati 
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.017
Recommendations
- On cyclic decompositions of complete graphs into tripartite graphs
- On \(\sigma \)-tripartite labelings of odd prisms and even Möbius ladders
- On the cyclic decomposition of complete graphs into bipartite graphs
- On cyclic \((C_{2m}+e)\)-designs
- On cyclic decompositions of the complete graph into the bipartite generalized Petersen graph \(P ( n , 3 )\)
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph designs and isomorphic decomposition (05C51)
Cites Work
- The CRC handbook of combinatorial designs
- A dynamic survey of graph labeling
- Title not available (Why is that?)
- A survey on the existence ofG-Designs
- Constructions for cyclic Moebius ladder systems
- Title not available (Why is that?)
- On the cyclic decomposition of complete graphs into bipartite graphs
- On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Rosa-type labelings and cyclic graph decompositions
- Title not available (Why is that?)
- Graceful labellings for an infinite class of generalised Petersen graphs.
Cited In (4)
This page was built for publication: On cyclic \(G\)-designs where \(G\) is a cubic tripartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658053)
