33 citations · 94 across the 15 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014
Strong edge-coloring of -bipartite graphs
Julien Bensmail, Aurélie Lagoutte, Petru Valicov
A strong edge-coloring of a graph is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of max…
cs.DM2014★ 33 cited
Identifying codes in hereditary classes of graphs and VC-dimension
Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li +2
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We show a dichot…