4 citations · 12 across the 10 of their papers we have counts for
4 papers · 1 filter
On two graph isomorphism problems
John Baptist Gauci, Jean Paul Zerafa
In 2015, Bogdanowicz gave a necessary and sufficient condition for a 4-regular circulant graph to be isomorphic to the Cartesian product of two cycles. Accordion graphs, denoted by…
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…
The Erdős--Faber--Lovász Conjecture revisited
John Baptist Gauci, Jean Paul Zerafa
The Erdős--Faber--Lovász Conjecture, posed in 1972, states that if a graph is the union of cliques of order (referred to as defining -cliques) such that two cliques…