activity
20102026
most citedIdentification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity

43 citations · 161 across the 15 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

math.CO2018

(2, 3)-bipartite graphs are strongly 6-edge-choosable

Petru Valicov

Kang and Park recently showed that every cubic (loopless) multigraph is incidence 6-choosable [On incidence choosability of cubic graphs. \emph{arXiv}, April 2018]. Equivalently, e…