Giuseppe Mazzuoccolo

According to our database1, Giuseppe Mazzuoccolo authored at least 45 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Normal edge-colorings of cubic graphs.
J. Graph Theory, 2020

Computational results and new bounds for the circular flow number of snarks.
Discret. Math., 2020

Normal 6-edge-colorings of some bridgeless cubic graphs.
Discret. Appl. Math., 2020

An equivalent formulation of the Fan-Raspaud Conjecture and related problems.
Ars Math. Contemp., 2020

2019
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs.
J. Graph Theory, 2019

Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations.
Discret. Math., 2019

An algorithm and new bounds for the circular flow number of snarks.
CoRR, 2019

Normal 5-edge-colorings of a family of Loupekhine snarks.
CoRR, 2019

A family of multigraphs with large palette index.
Ars Math. Contemp., 2019

2018
Cores, joins and the Fano-flow conjectures.
Discuss. Math. Graph Theory, 2018

A note on 2-bisections of claw-free cubic graphs.
Discret. Appl. Math., 2018

A unified approach to construct snarks with circular flow number 5.
CoRR, 2018

Measures of Edge-Uncolorability of Cubic Graphs.
Electron. J. Comb., 2018

2017
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4.
J. Graph Theory, 2017

Flows and Bisections in Cubic Graphs.
J. Graph Theory, 2017

2016
Edge-Colorings of 4-Regular Graphs with the Minimum Number of Palettes.
Graphs Comb., 2016

On the total coloring of generalized Petersen graphs.
Discret. Math., 2016

On the equitable total chromatic number of cubic graphs.
Discret. Appl. Math., 2016

Treelike Snarks.
Electron. J. Comb., 2016

2015
Nowhere-zero 5-flows.
Electron. Notes Discret. Math., 2015

On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph.
Discret. Math., 2015

Excessive [l, m]-factorizations.
Discret. Math., 2015

2014
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings.
J. Graph Theory, 2014

Upper Bounds for the Automorphic Chromatic Index of a Graph.
Graphs Comb., 2014

On the excessive [m]-index of a tree.
Discret. Appl. Math., 2014

2013
An Upper Bound for the Excessive Index of an <i>r</i>-Graph.
J. Graph Theory, 2013

New conjectures on perfect matchings in cubic graphs.
Electron. Notes Discret. Math., 2013

Invariant Kekulé structures in fullerene graphs.
Electron. Notes Discret. Math., 2013

Covering a cubic graph with perfect matchings.
Discret. Math., 2013

Covering cubic graphs with matchings of large size.
Australas. J Comb., 2013

On total coloring and equitable total coloring of cubic graphs with large girth.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2011
The equivalence of two conjectures of Berge and Fulkerson.
J. Graph Theory, 2011

Graphs of arbitrary excessive class.
Discret. Math., 2011

Cyclic and Dihedral 1-Factorizations of Multipartite Graphs.
Electron. J. Comb., 2011

Perfect one-factorizations in generalized Petersen graphs.
Ars Comb., 2011

2010
On the Automorphic Chromatic Index of a Graph.
Graphs Comb., 2010

Abelian 1-factorizations in infinite graphs.
Eur. J. Comb., 2010

The NP-completeness of authomorphic colorings.
Discuss. Math. Graph Theory, 2010

Sharply Transitive 1-Factorizations of Complete Multipartite Graphs.
Electron. J. Comb., 2010

2008
On 2-factorizations whose automorphism group acts doubly transitively on the factors.
Discret. Math., 2008

Primitive 2-factorizations of the complete graph.
Discret. Math., 2008

Perfect one-factorizations in line-graphs and planar graphs.
Australas. J Comb., 2008

2007
<i>k</i> -Pyramidal One-Factorizations.
Graphs Comb., 2007

2006
On 2-factorizations with some symmetry.
Electron. Notes Discret. Math., 2006

On perfectly one-factorable cubic graphs.
Electron. Notes Discret. Math., 2006


  Loading...