1 paper · 2 filters
Tapas Das, Pavan P D, Sagnik Sen +1
An oriented graph G is pushably k-critical if it is not pushably k-colorable, but every proper subgraph of G is. The main result of this a…