1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2010
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.
cs.DM2010★ 1 cited
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…