\(G\)-designs for the connected triangular bicyclic graphs with nine edges
type: Item
instance of: scholarly article
title: \(G\)-designs for the connected triangular bicyclic graphs with nine edges
author: Bryan Freyberg
author: Dalibor Fronček
author: Joel Jeffries
author: Gretta Jensen
author: Andrew Sailstad
published in: Transactions on Combinatorics
publication date: 2025-01-27T00:00:00Z
Mathematics Subject Classification ID: 05C51
Mathematics Subject Classification ID: 05B30
zbMATH DE Number: 7975419
zbMATH Keywords: graph decomposition
zbMATH Keywords: bicyclic graphs
zbMATH Keywords: rho-labelings
MaRDI profile type: MaRDI publication profile
cites work: A survey on the existence ofG-Designs
cites work: Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges
cites work: Q4443941
cites work: Q6109799
cites work: On 1-rotational decompositions of complete graphs into tripartite graphs
cites work: On Cyclic Decompositions of Complete Graphs into Tripartite Graphs
cites work: Graph designs for the eight-edge five-vertex graphs
cites work: A new class of group divisible designs with block size three
cites work: On Rosa-type labelings and cyclic graph decompositions
cites work: Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges
cites work: Q5374251
cites work: Q5855396
cites work: Q5855397
cites work: Q5032429
cites work: Q5855398
cites work: Q3295499
cites work: Graph designs for all graphs with six vertices and eight edges
cites work: Q5589124
cites work: Q5310225
cites work: Some recent developments on BIBDs and related designs
DOI: 10.22108/TOC.2024.140831.2156
description: scientific article; zbMATH DE number 7975419