On decompositions of K₁₈k and K₁₈k+1 into certain connected bicyclic graphs with nine edges

MaRDI QIDQ6561542zbMATH OpenFDO

Authors R. C. Bunge, Dalibor Fronček, Andrew Sailstad

Publication date 25 June 2024

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

\( \rho \)-labelingsgraph decompositionstripartite graphs

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51)

Recommendations

• Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges
• scientific article; zbMATH DE number 7706795
• G-designs for the connected triangular bicyclic graphs with nine edges
• Cyclic decompositions of complete graphs into \(K_{k,m}+e\): the missing case
• scientific article; zbMATH DE number 7325724

Cites work

• scientific article; zbMATH DE number 7219308 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• On 1-rotational decompositions of complete graphs into tripartite graphs
• On cyclic decompositions of complete graphs into tripartite graphs

Cited in

(2)

• G-designs for the connected triangular bicyclic graphs with nine edges
• Decomposition of complete graphs into forests with six edges

This page was built for publication: On decompositions of \(K_{18k}\) and \(K_{18k+1}\) into certain connected bicyclic graphs with nine edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561542)