1k citations
- University of OxfordGB52 papers
- Centre National de la Recherche ScientifiqueFR50 papers
- University of SussexGB42 papers
- University of California, BerkeleyUS39 papers
- Goddard Space Flight CenterUS38 papers
- The University of Texas at AustinUS32 papers
- University of ManchesterGB32 papers
- Rochester Institute of TechnologyUS31 papers
- Search for Extraterrestrial IntelligenceUS31 papers
- Texas A&M UniversityUS27 papers
- Deleted Institution26 papers
- Mitchell InstituteUS26 papers
31 papers · 1 filter
Proof of a conjecture on isolation of graphs dominated by a vertex
Peter Borg
A copy of a graph is called an -copy. For any graph , the -isolation number of , denoted by , is the size of a smallest subset of the vertex set of …
Three-cuts are a charm: acyclicity in 3-connected cubic graphs
František Kardoš, Edita Máčajová, Jean Paul Zerafa
Let be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the -Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchi…
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…
Isolation of regular graphs, stars and -chromatic graphs
Peter Borg
Given a set of graphs, we call a copy of a graph in an -graph. The -isolation number of a graph , denoted by $ι(G,\mathcal{…
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…
On the existence of graphs which can colour every regular graph
Giuseppe Mazzuoccolo, Gloria Tabarelli, Jean Paul Zerafa
Let and be graphs. An -colouring of is a proper edge-colouring such that for any vertex there exists a vertex with $…