5 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…
On 2-bisections and monochromatic edges in claw-free cubic multigraphs
Federico Romaniello
A -bisection of a multigraph is a partition of its vertex set into two parts of the same cardinality such that every component of each part has at most vertices. Cui and…
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…
The Perfect Matching Hamiltonian property in Prism and Crossed Prism graphs
Francesco Colangelo, Federico Romaniello
A graph has the \emph{Perfect Matching Hamiltonian property} (or for short, is ) if, for each one of its perfect matchings, there is another perfect matching of su…
An updated survey on 2-Factors of Regular Graphs
D. Labbate, F. Romaniello
A 2-factor of a graph is a 2-regular spanning subgraph of . We present a survey summarising results on the structure of 2-factors in regular graphs, as achieved by various r…