27 citations · 60 across the 22 of their papers we have counts for
24 papers
The Gray graph is pseudo 2-factor isomorphic
Marien Abreu, Jan Goedgebeur, Jorik Jooken +2
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that…
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
M. Abreu, J. B. Gauci, D. Mattiolo +4
A proper total colouring of a graph is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…
The Pairing-Hamiltonian property in graph prisms
Marién Abreu, Giuseppe Mazzuoccolo, Federico Romaniello +1
Let be a graph of even order, and consider as the complete graph on the same vertex set as . A perfect matching of is called a pairing of . If for every pairi…
A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture
M. Abreu, M. Funk, D. Labbate +1
A graph admiting a -factor is \textit{pseudo -factor isomorphic} if the parity of the number of cycles in all its -factors is the same. In [M. Abreu, A.A. Diwan, B. Ja…
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs
Marién Abreu, John Baptist Gauci, Domenico Labbate +2
A graph has the Perfect-Matching-Hamiltonian property (PMH-property) if for each one of its perfect matchings, there is another perfect matching of such that the union of t…
Saved by the rook: a case of matchings and Hamiltonian cycles
Marién Abreu, John Baptist Gauci, Jean Paul Zerafa
The rook graph is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set co…