On some intriguing problems in hamiltonian graph theory: a survey
Discrete Mathematics
On the Domination Search Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs
Journal of Combinatorial Theory Series B
On the domination search number
Discrete Applied Mathematics
On the number of Hamiltonian cycles in Dirac graphs
Discrete Mathematics
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
Journal of Combinatorial Theory Series B
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence
Journal of Combinatorial Theory Series B
Hamiltonicity and colorings of arrangement graphs
Discrete Applied Mathematics
Cycle double covers and spanning minors I
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Hypomorphy of graphs up to complementation
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics
Hamiltonian degree sequences in digraphs
Journal of Combinatorial Theory Series B
Pancyclicity of Hamiltonian and highly connected graphs
Journal of Combinatorial Theory Series B
An effective algorithm for and phase transitions of the directed hamiltonian cycle problem
Journal of Artificial Intelligence Research
Pancyclic subgraphs of random graphs
Journal of Graph Theory
On prisms, Möbius ladders and the cycle space of dense graphs
European Journal of Combinatorics
Hamilton decompositions of regular expanders: Applications
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |