21 citations · 92 across the 33 of their papers we have counts for
4 papers · 1 filter
Extending perfect matchings to Hamiltonian cycles in line graphs
Marién Abreu, John Baptist Gauci, Domenico Labbate +2
A graph admitting a perfect matching has the Perfect-Matching-Hamiltonian property (for short the PMH-property) if each of its perfect matchings can be extended to a Hamiltonian cy…
An algorithm and new bounds for the circular flow number of snarks
Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo
It is well-known that the circular flow number of a bridgeless cubic graph can be computed in terms of certain partitions of its vertex-set with prescribed properties. In the prese…
Normal -edge-colorings of a family of Loupekhine snarks
Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan
In a proper edge-coloring of a cubic graph an edge is called poor or rich, if the set of colors of the edges incident to and contains exactly three or five colors, res…
Normal 6-edge-colorings of some bridgeless cubic graphs
Giuseppe Mazzuoccolo, Vahan Mkrtchyan
In an edge-coloring of a cubic graph, an edge is poor or rich, if the set of colors assigned to the edge and the four edges adjacent it, has exactly five or exactly three distinct…