# Search results for: Giuseppe Mazzuoccolo

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 165-175

Journal of Graph Theory > 85 > 2 > 363 - 371

Graphs and Combinatorics > 2016 > 32 > 4 > 1293-1311

*G*is an assignment of colors to the edges of

*G*such that adjacent edges receive distinct colors. A proper edge-coloring defines at each vertex the set of colors of its incident edges. Following the terminology introduced by Horňák, Kalinowski, Meszka and Woźniak, we call such a set of colors the palette of the vertex. What is the minimum number of distinct palettes...

Discrete Mathematics > 2015 > 338 > 11 > 1917-1927

Electronic Notes in Discrete Mathematics > 2015 > 49 > C > 51-55

Graphs and Combinatorics > 2014 > 30 > 4 > 963-975

*H*-chromatic index of a graph Γ is the minimum integer

*m*for which Γ has a proper edge-coloring with

*m*colors preserved by a given subgroup

*H*of the full automorphism group of Γ. We determine upper bounds for this index in terms of the chromatic index of Γ for some abelian 2-groups

*H*.

Journal of Graph Theory > 73 > 4 > 377 - 376

*r*‐graphs having a minimum 1‐factor cover of cardinality $2r-1$ (disproving a conjecture of Bonisoli and Cariolaro, Birkhäuser, Basel, 2007, 73–84). Furthermore, we show the equivalence between the statement that $2r-1$ is the best possible upper bound for the cardinality of a minimum 1‐factor cover of an

*r*‐graph and the well‐known generalized Berge–Fulkerson conjecture.

Electronic Notes in Discrete Mathematics > 2013 > 40 > Complete > 323-327

Electronic Notes in Discrete Mathematics > 2013 > 40 > Complete > 235-238

Discussiones Mathematicae Graph Theory > 2010 > 30 > 4 > 705-710

Results in Mathematics > 2010 > 58 > 3-4 > 241-254

*G*-chromatic index of a graph Γ is the minimum integer

*m*for which Γ has a proper edge-coloring with

*m*colors which is preserved by the full automorphism group

*G*of Γ. We determine the automorphic

*G*-chromatic index of each member of four infinite classes of snarks: type I Blanuša snarks, type II Blanuša snarks, Flower snarks and Goldberg snarks.

Graphs and Combinatorics > 2010 > 26 > 5 > 685-694

*H*-chromatic index of a graph Γ as the minimum integer

*m*for which Γ has a proper edge-coloring with

*m*colors which is preserved by a given automorphism group

*H*of Γ. After the description of some properties, we determine upper bounds for this index when

*H*is a cyclic group of prime order. We also show that these upper bounds are best possible in a number of...

Discrete Mathematics > 2008 > 308 > 5-6 > 931-939

Discrete Mathematics > 2008 > 308 > 2-3 > 175-179

Graphs and Combinatorics > 2007 > 23 > 3 > 315-326

*k*≥ 0 vertices and acting regularly (i.e., sharply transitively) on the others. Since the cases

*k*= 0 and

*k*= 1 are well known in literature, we study the case

*k*≥ 2 in some detail. We prove that both

*k*and the order of the group are even and the group necessarily contains

*k*− 1 involutions. Constructions for...

Electronic Notes in Discrete Mathematics > 2006 > 24 > Complete > 133-135

Electronic Notes in Discrete Mathematics > 2006 > 24 > Complete > 47-51