arXiv:2408.04642v2 [math.CO] 15 Aug 2024 Page 1 An updated survey on 2-Factors of Regular
Graphs Domenico Labbate , Federico Romaniello Dipartimento di Matematica, Informatica ed …

A snark is a cubic cyclically 4-edge connected graph with edge chromatic number four and
girth at least five. We say that a graph G is odd 2-factored if for each 2-factor F of G each …

We consider the class of 2-connected cubic graphs having only k-cycles in each 2-factor,
and obtain the following two results:(i) every 2-connected cubic graph having only 8-cycles …

A graph G admitting a 2-factor is pseudo 2-factor isomorphic if the parity of the number of
cycles in all its 2-factors is the same. In Abreu et al.(2008) some of the authors of this note …

A graph G is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is
the same for all 2-factors of G. Abreu et al. conjectured that K 3, 3, the Heawood graph and …

A graph G is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is
the same for all 2-factors of G. In Abreu et al.(2008)[3] we proved that pseudo 2-factor …

A bipartite graph is pseudo 2-factor isomorphic if the number of circuits in each 2-factor of
the graph is always even or always odd. We proved (Abreu et al., J Comb Theory B 98: 432 …

We consider cubic graphs formed with $ k\geq 2$ disjoint claws $ C_i\sim K_ {1, 3} $($0\leq
i\leq k-1$) such that for every integer $ i $ modulo $ k $ the three vertices of degree 1 of …

Lecture Notes of Seminario Interdisciplinare di Matematica Vol. 14(2017), pp. 1 – 15. 2–Factors
of regular graphs: an update Page 1 Lecture Notes of Seminario Interdisciplinare di …

The study of perfect matchings in a graph is a classical topic in graph theory, with many
fundamental results, structural as well as algorithmic. One of the earliest results in graph …