# Massimiliano Marangio

• Discussiones Mathematicae Graph Theory
• 2015
Let P and Q be additive and hereditary graph properties, r, s âˆˆ N, r â‰¥ s, and [Zr] be the set of all s-element subsets of Zr. An (r, s)-fractional This work was supported by the Slovak Science andâ€¦ (More)
• 1
• Discussiones Mathematicae Graph Theory
• 2011
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be additive hereditary properties of graphs. A (P ,Q)-totalâ€¦ (More)
• 4
• Discrete Mathematics
• 2015
If c : V âˆª E â†’ {1, 2, . . . , k} is a proper total coloring of a graph G = (V,E) then the palette S[v] of a vertex v âˆˆ V is the set of colors of the incident edges and the color of v: S[v] = {c(e) :â€¦ (More)
• Discrete Mathematics
• 2007
Given non-negative integers r, s, and t, an [r, s, t]-coloring of a graph G= (V (G),E(G)) is a mapping c from V (G) âˆªE(G) to the color set {0, 1, . . . , k âˆ’ 1} such that |c(vi)âˆ’ c(vj )| r for everyâ€¦ (More)
• Discrete Mathematics
• 2007
Given non-negative integers r, s, and t, an [r, s, t]-coloring of a graph G = (V (G), E(G)) is a mapping c from V (G)âˆªE(G) to the color set {0, 1, . . . , kâˆ’ 1}, k âˆˆ N, such that |c(vi)âˆ’ c(vj)| â‰¥ râ€¦ (More)
• Discussiones Mathematicae Graph Theory
• 2016
Let G = (V,E) be a simple graph and for every edge e âˆˆ E let L(e) be a set (list) of available colors. The graph G is called L-edge colorable if there is a proper edge coloring c of G with c(e) âˆˆâ€¦ (More)