13 citations · 39 across the 22 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013
Maximal induced matchings in triangle-free graphs
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof +2
An induced matching in a graph is a set of edges whose endpoints induce a -regular subgraph. It is known that any -vertex graph has at most maxima…
math.CO2013★ 1 cited
Strong chromatic index of chordless graphs
Manu Basavaraju, Mathew C. Francis
A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced mat…