default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiuseppe Mazzuoccolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]Edita Mácajová, Giuseppe Mazzuoccolo, Vahan Mkrtchyan, Jean Paul Zerafa
:
Some snarks are worse than others. Eur. J. Comb. 117: 103832 (2024)- 2023
- [j50]Giuseppe Mazzuoccolo, Gloria Tabarelli, Jean Paul Zerafa:
On the existence of graphs which can colour every regular graph. Discret. Appl. Math. 337: 246-256 (2023) - [j49]Domenico Labbate, Davide Mattiolo, Giuseppe Mazzuoccolo, Federico Romaniello, Gloria Tabarelli:
A Characterization of Graphs with Small Palette Index. Symmetry 15(1): 154 (2023) - 2022
- [j48]Davide Mattiolo, Giuseppe Mazzuoccolo, Gloria Tabarelli:
Graphs with large palette index. Discret. Math. 345(5): 112814 (2022) - 2021
- [j47]Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
On sublinear approximations for the Petersen coloring conjecture. Bull. ICA 92: 78-90 (2021) - [j46]Marién Abreu, John Baptist Gauci, Domenico Labbate, Giuseppe Mazzuoccolo, Jean Paul Zerafa:
Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j45]Giuseppe Mazzuoccolo, Lorenzo Mella:
On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching. Discret. Appl. Math. 301: 19-25 (2021) - [j44]Davide Mattiolo, Giuseppe Mazzuoccolo:
On 3-Bisections in Cubic and Subcubic Graphs. Graphs Comb. 37(3): 743-746 (2021) - [j43]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. J. Graph Theory 97(1): 47-69 (2021) - [i8]Davide Mattiolo, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
On sublinear approximations for the Petersen coloring conjecture. CoRR abs/2104.09241 (2021) - 2020
- [j42]Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 5-edge-colorings of a family of Loupekhine snarks. AKCE Int. J. Graphs Comb. 17(3): 720-724 (2020) - [j41]Giuseppe Mazzuoccolo, Jean Paul Zerafa:
An equivalent formulation of the Fan-Raspaud Conjecture and related problems. Ars Math. Contemp. 18(1): 87-103 (2020) - [j40]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 6-edge-colorings of some bridgeless cubic graphs. Discret. Appl. Math. 277: 252-262 (2020) - [j39]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
Computational results and new bounds for the circular flow number of snarks. Discret. Math. 343(10): 112026 (2020) - [j38]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal edge-colorings of cubic graphs. J. Graph Theory 94(1): 75-91 (2020)
2010 – 2019
- 2019
- [j37]Maddalena Avesani, Arrigo Bonisoli, Giuseppe Mazzuoccolo:
A family of multigraphs with large palette index. Ars Math. Contemp. 17(1): 115-124 (2019) - [j36]Giuseppe Mazzuoccolo, Gloria Rinaldi:
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations. Discret. Math. 342(4): 1006-1016 (2019) - [j35]Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. J. Graph Theory 92(4): 415-444 (2019) - [i7]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 6-edge-colorings of some bridgeless cubic graphs. CoRR abs/1903.06043 (2019) - [i6]Luca Ferrarini, Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 5-edge-colorings of a family of Loupekhine snarks. CoRR abs/1904.02661 (2019) - [i5]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
An algorithm and new bounds for the circular flow number of snarks. CoRR abs/1909.09870 (2019) - 2018
- [j34]Miquel A. Fiol, Giuseppe Mazzuoccolo, Eckhard Steffen:
Measures of Edge-Uncolorability of Cubic Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j33]Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
A note on 2-bisections of claw-free cubic graphs. Discret. Appl. Math. 244: 214-217 (2018) - [j32]Ligang Jin, Giuseppe Mazzuoccolo, Eckhard Steffen:
Cores, joins and the Fano-flow conjectures. Discuss. Math. Graph Theory 38(1): 165-175 (2018) - [i4]Jan Goedgebeur, Davide Mattiolo, Giuseppe Mazzuoccolo:
A unified approach to construct snarks with circular flow number 5. CoRR abs/1804.00957 (2018) - [i3]Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal edge-colorings of cubic graphs. CoRR abs/1804.09449 (2018) - 2017
- [j31]Giuseppe Mazzuoccolo, Eckhard Steffen:
Nowhere-Zero 5-Flows On Cubic Graphs with Oddness 4. J. Graph Theory 85(2): 363-371 (2017) - [j30]Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi:
Flows and Bisections in Cubic Graphs. J. Graph Theory 86(2): 149-158 (2017) - [i2]Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. CoRR abs/1705.06928 (2017) - 2016
- [j29]Marién Abreu, Tomás Kaiser, Domenico Labbate, Giuseppe Mazzuoccolo:
Treelike Snarks. Electron. J. Comb. 23(3): 3 (2016) - [j28]Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On the equitable total chromatic number of cubic graphs. Discret. Appl. Math. 209: 84-91 (2016) - [j27]Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On the total coloring of generalized Petersen graphs. Discret. Math. 339(5): 1471-1475 (2016) - [j26]Simona Bonvicini, Giuseppe Mazzuoccolo:
Edge-Colorings of 4-Regular Graphs with the Minimum Number of Palettes. Graphs Comb. 32(4): 1293-1311 (2016) - 2015
- [j25]Louis Esperet, Giuseppe Mazzuoccolo:
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph. Discret. Math. 338(8): 1509-1514 (2015) - [j24]David Cariolaro, Giuseppe Mazzuoccolo:
Excessive [l, m]-factorizations. Discret. Math. 338(11): 1917-1927 (2015) - [j23]Eckhard Steffen, Giuseppe Mazzuoccolo:
Nowhere-zero 5-flows. Electron. Notes Discret. Math. 49: 51-55 (2015) - 2014
- [j22]Giuseppe Mazzuoccolo:
On the excessive [m]-index of a tree. Discret. Appl. Math. 162: 264-270 (2014) - [j21]Giuseppe Mazzuoccolo, Beatrice Ruini:
Upper Bounds for the Automorphic Chromatic Index of a Graph. Graphs Comb. 30(4): 963-975 (2014) - [j20]Louis Esperet, Giuseppe Mazzuoccolo:
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings. J. Graph Theory 77(2): 144-157 (2014) - 2013
- [j19]Simona Bonvicini, Giuseppe Mazzuoccolo:
Covering cubic graphs with matchings of large size. Australas. J Comb. 56: 245-256 (2013) - [j18]Giuseppe Mazzuoccolo:
Covering a cubic graph with perfect matchings. Discret. Math. 313(20): 2292-2296 (2013) - [j17]Giuseppe Mazzuoccolo:
New conjectures on perfect matchings in cubic graphs. Electron. Notes Discret. Math. 40: 235-238 (2013) - [j16]Mathieu Bogaerts, Giuseppe Mazzuoccolo, Gloria Rinaldi:
Invariant Kekulé structures in fullerene graphs. Electron. Notes Discret. Math. 40: 323-327 (2013) - [j15]Giuseppe Mazzuoccolo:
An Upper Bound for the Excessive Index of an r-Graph. J. Graph Theory 73(4): 377-376 (2013) - [i1]Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On total coloring and equitable total coloring of cubic graphs with large girth. CTW 2013: 79-83 - 2011
- [j14]Simona Bonvicini, Giuseppe Mazzuoccolo:
Perfect one-factorizations in generalized Petersen graphs. Ars Comb. 99: 33-43 (2011) - [j13]Mathieu Bogaerts, Giuseppe Mazzuoccolo:
Cyclic and Dihedral 1-Factorizations of Multipartite Graphs. Electron. J. Comb. 18(1) (2011) - [j12]Giuseppe Mazzuoccolo, M. Young:
Graphs of arbitrary excessive class. Discret. Math. 311(1): 32-37 (2011) - [j11]Giuseppe Mazzuoccolo:
The equivalence of two conjectures of Berge and Fulkerson. J. Graph Theory 68(2): 125-128 (2011) - 2010
- [j10]Giuseppe Mazzuoccolo, Gloria Rinaldi:
Sharply Transitive 1-Factorizations of Complete Multipartite Graphs. Electron. J. Comb. 17(1) (2010) - [j9]Giuseppe Mazzuoccolo:
The NP-completeness of authomorphic colorings. Discuss. Math. Graph Theory 30(4): 705-710 (2010) - [j8]Simona Bonvicini, Giuseppe Mazzuoccolo:
Abelian 1-factorizations in infinite graphs. Eur. J. Comb. 31(7): 1847-1852 (2010) - [j7]Carla Fiori, Giuseppe Mazzuoccolo, Beatrice Ruini:
On the Automorphic Chromatic Index of a Graph. Graphs Comb. 26(5): 685-694 (2010)
2000 – 2009
- 2008
- [j6]Giuseppe Mazzuoccolo:
Perfect one-factorizations in line-graphs and planar graphs. Australas. J Comb. 41: 227-234 (2008) - [j5]Giuseppe Mazzuoccolo:
Primitive 2-factorizations of the complete graph. Discret. Math. 308(2-3): 175-179 (2008) - [j4]Giuseppe Mazzuoccolo:
On 2-factorizations whose automorphism group acts doubly transitively on the factors. Discret. Math. 308(5-6): 931-939 (2008) - 2007
- [j3]Giuseppe Mazzuoccolo, Gloria Rinaldi:
k -Pyramidal One-Factorizations. Graphs Comb. 23(3): 315-326 (2007) - 2006
- [j2]Simona Bonvicini, Giuseppe Mazzuoccolo:
On perfectly one-factorable cubic graphs. Electron. Notes Discret. Math. 24: 47-51 (2006) - [j1]Giuseppe Mazzuoccolo:
On 2-factorizations with some symmetry. Electron. Notes Discret. Math. 24: 133-135 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
