Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On a theorem of Sewell and Trotter
European Journal of Combinatorics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the feedback vertex set polytope of a series-parallel graph
Discrete Optimization
| Hi-index | 0.00 |