Hamiltonian iterated line graphs
Discrete Mathematics
A note on minimum degree conditions for supereulerian graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Path decomposition under a new cost measure with applications to optical network design
ACM Transactions on Algorithms (TALG)
On the general routing polytope
Discrete Applied Mathematics
A Degree-Condition for (s, t)-Supereulerian Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
On (s, t)-Supereulerian Locally Connected Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Hamiltonian connectedness in 3-connected line graphs
Discrete Applied Mathematics
Supereulerianity of k-edge-connected graphs with a restriction on small bonds
Discrete Applied Mathematics
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Supereulerian graphs in the graph family C2(6,k)
Discrete Applied Mathematics
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Spanning cycles in regular matroids without small cocircuits
European Journal of Combinatorics
Hi-index | 0.00 |