53 citations · 217 across the 33 of their papers we have counts for
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011
Rainbow Matchings of size δ(G) in Properly Edge-colored Graphs
Jennifer Diemunsch, Michael Ferrara, Casey Moffatt +2
A {\it rainbow matching} in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function f(δ) such that a properly edge-colore…
math.CO2011★ 3 cited
Total Vertex Irregularity Strength of Forests
Marcin Anholcer, Michał Karoński, Florian Pfender
We investigate a graph parameter called the total vertex irregularity strength (), i.e. the minimal such that there is a labeling $w: E(G)\cup V(G)\rightarrow \{1,2,..,…