Márcia R. Cerioli

collaborators

2 papers

cs.DM2017

Transversals of Longest Paths

Márcia R. Cerioli, Cristina G. Fernandes, Renzo Gómez +2

Let $\lpt(G)$ be the minimum cardinality of a set of vertices that intersects all longest paths in a graph $G$ . Let $ω (G)$ be the size of a maximum clique in $G$ , and $\tw(G)$ be t…

math.CO2017

Edge-magic labelings for constellations and armies of caterpillars

Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee +3

Let $G = (V, E)$ be an $n$ -vertex graph with $m$ edges. A function $f : V \cup E \to {1, \dots, n + m}$ is an edge-magic labeling of $G$ if $f$ is bijective and, for some int…