Blocking sets for cycles and paths designs

DOI10.2298/AADM181108008BzbMath1474.05026MaRDI QIDQ4988988

Lucia Marino, Paola Bonacini

Publication date: 20 May 2021

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycledesignpath

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Blocking sets in \((v,\{ 2,4 \} ,1)\)-designs
• 2-colourings in \(S(t, t+1, v)\)
• A note on the decomposition of graphs into isomorphic matchings
• Disjoint blocking sets in cycle systems
• Bicolouring Steiner systems \(S\)(2,4,\(v\))
• Tight blocking sets in some maximum packings of \(\lambda K_n\)
• Perfect blocking sets in P3-designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Blocking sets for cycles and paths designs