\(G\)-designs for the connected triangular bicyclic graphs with nine edges

DOI10.22108/toc.2024.140831.2156MaRDI QIDQ6671970

Bryan Freyberg, Andrew Sailstad, Dalibor Froncek, Gretta Jensen, Joel Jeffries

Publication date: 27 January 2025

Published in: Transactions on Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graph decompositionbicyclic graphsrho-labelings

Mathematics Subject Classification ID

Other designs, configurations (05B30) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Graph designs for the eight-edge five-vertex graphs
• A new class of group divisible designs with block size three
• Some recent developments on BIBDs and related designs
• Graph designs for all graphs with six vertices and eight edges
• A survey on the existence ofG-Designs
• 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
• Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges
• \(G\)-designs for the connected triangular bicyclic graphs with nine edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (1)

\(G\)-designs for the connected triangular bicyclic graphs with nine edges

This page was built for publication: \(G\)-designs for the connected triangular bicyclic graphs with nine edges