Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges

DOI10.5614/EJGTA.2023.11.1.22zbMath1514.05110OpenAlexW4362733240MaRDI QIDQ6109795

Unnamed Author, Bryan Freyberg, Unnamed Author, Unnamed Author

Publication date: 4 July 2023

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2023.11.1.22

zbMATH Keywords

graph decomposition\( \rho \)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• On Rosa-type labelings and cyclic graph decompositions
• On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
• Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
• On 1-rotational decompositions of complete graphs into tripartite graphs

This page was built for publication: Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges