Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

DOI10.5614/EJGTA.2019.7.2.4zbMath1467.05166OpenAlexW2980993470MaRDI QIDQ5009951

Dalibor Fronček, John Fahnenstiel

Publication date: 23 August 2021

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.2019.7.2.4

zbMATH Keywords

graph decomposition\( \alpha \)-labeling\( \sigma^+\)-labelingrosa type labeling

Mathematics Subject Classification ID

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

Related Items (3)

Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges ⋮ Unnamed Item ⋮ $C_4$-decomposition of the tensor product of complete graphs

Cites Work

• Graph designs for the eight-edge five-vertex graphs
• Graph designs for all graphs with six vertices and eight edges
• On Rosa-type labelings and cyclic graph decompositions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges