37 citations · 50 across the 12 of their papers we have counts for
3 papers · 1 filter
Locally identifying coloring of graphs
Louis Esperet, Sylvain Gravier, Mickael Montassier +2
We introduce the notion of locally identifying coloring of a graph. A proper vertex-coloring c of a graph G is said to be locally identifying, if for any adjacent vertices u and v…
Covering a graph by forests and a matching
Tomas Kaiser, Mickael Montassier, Andre Raspaud
We prove that for any positive integer , the edges of any graph whose fractional arboricity is at most can be decomposed into forests and a matching.
On two variations of identifying codes
Olivier Delmas, Sylvain Gravier, Mickael Montassier +1
Identifying codes have been introduced in 1998 to model fault-detection in multiprocessor systems. In this paper, we introduce two variations of identifying codes: weak codes and l…