#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1988

2014

- This year (0)
- Last 5 years (2)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi
- Discrete Mathematics
- 2005

Let D be the triangle with an attached edge (i. e. D is the “kite”, a graph having vertices {a0, a1, a2, a3} and edges {a0, a1}, {a0, a2}, {a1, a2}, {a0, a3}). Bermond and Schönheim [6] proved that a… (More)

- Gaetano Quattrocchi
- Discrete Mathematics
- 2003

Let D be the triangle with attached edge (i. e. D is the graph having vertices {a0, a1, a2, a3} and edges {a0, a1}, {a0, a2}, {a1, a2}, {a0, a3}). J.C. Bermond and J. Schönheim [1], proved that a… (More)

- Salvatore Milici, Gaetano Quattrocchi
- Discrete Mathematics
- 1999

Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a handcuffed design (Ω,P) of order v and block size s (2 ≤ s ≤ m−1) is contained in (W, C) if for every p ∈ P there… (More)

- Gaetano Quattrocchi
- Discrete Mathematics
- 2002

Let (W, C) be an m-cycle system of order n and let Ω ⊂ W , |Ω| = v < n. We say that a path design (Ω,P) of order v and block size s (2 ≤ s ≤ m− 1) is embedded in (W, C) if for every p ∈ P there is an… (More)

- Charles J. Colbourn, Gaetano Quattrocchi, Violet R. Syrotiuk
- Networks
- 2008

Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and all-to-all,… (More)

- Mario Gionfriddo, Gaetano Quattrocchi
- Discrete Mathematics
- 2008

- Charles C. Lindner, Gaetano Quattrocchi, Christopher A. Rodger
- Discrete Mathematics
- 2009

- Jean-Claude Bermond, Charles J. Colbourn, Lucia Gionfriddo, Gaetano Quattrocchi, Ignasi Sau
- SIAM J. Discrete Math.
- 2010

We study grooming for two-period optical networks, a variation of the traffic grooming problem for wavelength division multiplexed (WDM) ring networks introduced by Colbourn, Quattrocchi, and… (More)

- Elizabeth J. Billington, Gaetano Quattrocchi
- Ars Comb.
- 2002

In this paper necessary and suÆcient conditions are given for the metamorphosis of a -foldK3;3-design of order n into a -fold 6-cycle system of order n, by retaining one 6-cycle subgraph from each… (More)

- Peter Danziger, Eric Mendelsohn, Gaetano Quattrocchi
- Discrete Mathematics
- 2004

If G = (V ′, E) is a graph and H = (V, H) is a graph whose edges can be decomposed into isomorphic copies of G, then we define a k-block colouring of a G−decomposition of H to be an assignment of k… (More)