#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2000

2019

- This year (1)
- Last 5 years (11)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marién Abreu, Martin Funk, Domenico Labbate, Vito Napolitano
- Australasian J. Combinatorics
- 2006

- Marién Abreu, Camino Balbuena, Domenico Labbate
- Des. Codes Cryptogr.
- 2010

In this paper we give a method for obtaining the adjacency matrix of a simple polarity graph Gq from a projective plane PG(2, q), where q is a prime power. Denote by ex(n; C4) the maximum number of… (More)

- Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan
- J. Comb. Theory, Ser. B
- 2003

The Heawood graph and K3, 3 have the property that all of their 2-factors are Hamilton circuits. We call such graphs 2-factor hamiltonian. We prove that if G is a k-regular bipartite 2- factor… (More)

We consider one-factorizations of K2n possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one-factors which are fixed… (More)

- Marién Abreu, A. A. Diwan, Bill Jackson, Domenico Labbate, John Sheehan
- J. Comb. Theory, Ser. B
- 2008

A graph G is pseudo 2-factor isomorphic if the parity of the number of circuits in a 2-factor is the same for all 2-factors of G. We prove that there exist no pseudo 2-factor isomorphic k-regular… (More)

- Martin Funk, Domenico Labbate
- Discrete Mathematics
- 2000

A corollary to the famous Marriage Theorem by Ph. Hall [7] says that every r-regular bipartite graph is one-factorable (cf. e.g. [10, Theorem 3:2]); a glance at the proof reveals that this theorem… (More)

- Martin Funk, Domenico Labbate, Vito Napolitano
- Discrete Mathematics
- 2009

We introduce a new method to describe tactical (de-)compositions of symmetric configurations via block (0,1)-matrices with constant row and column sum having circulant blocks. This method allows us… (More)

- Marién Abreu, Tomás Kaiser, Domenico Labbate, Giuseppe Mazzuoccolo
- Electr. J. Comb.
- 2016

We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund. We… (More)

- Domenico Labbate
- Discrete Mathematics
- 2002

The possibilities for circuits of length 4 to appear together in a cubic bigraph are classified. That has consequences on the structure of minimally 1-factorable regular bigraphs, i.e. those in which… (More)

- Domenico Labbate
- Discrete Mathematics
- 2001

A cubic bigraph G is minimally 1-factorable if every 1-factor lies in precisely one 1-factorization. We characterize 3-bridges of G and prove that the 3-cut reductions of G are still minimally… (More)