Towards a characterisation of Pfaffian near bipartite graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
The perfect matching polytope and solid bricks
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
An O(VE) algorithm for ear decompositions of matching-covered graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An O(VE) algorithm for ear decompositions of matching-covered graphs
ACM Transactions on Algorithms (TALG)
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
2-extendability of toroidal polyhexes and Klein-bottle polyhexes
Discrete Applied Mathematics
An improved linear bound on the number of perfect matchings in cubic graphs
European Journal of Combinatorics
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
European Journal of Combinatorics
A generalization of Little's Theorem on Pfaffian orientations
Journal of Combinatorial Theory Series B
Minimal bricks have many vertices of small degree
European Journal of Combinatorics
Hi-index | 0.00 |