SEARCH

SEARCH BY CITATION

Cited in:

CrossRef

This article has been cited by:

  1. 1
    Zdeněk Ryjáček, Petr Vrána, A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs, Journal of Graph Theory, 2014, 75, 4
  2. 2
    Zdeněk Ryjáček, Liming Xiong, Jun Yin, Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs, Graphs and Combinatorics, 2014,

    CrossRef

  3. 3
    Tomáš Kaiser, Zdeněk Ryjáček, Petr Vrána, On 1-Hamilton-connected claw-free graphs, Discrete Mathematics, 2014, 321, 1

    CrossRef

  4. 4
    Ronald J. Gould, Recent Advances on the Hamiltonian Problem: Survey III, Graphs and Combinatorics, 2014, 30, 1, 1

    CrossRef

  5. 5
    Jill R. Faudree, Ralph J. Faudree, Zdeněk Ryjáček, Petr Vrána, On Forbidden Pairs Implying Hamilton-Connectedness, Journal of Graph Theory, 2013, 72, 3
  6. 6
    Mirka Miller, Joe Ryan, Zdeněk Ryjáček, Jakub Teska, Petr Vrána, Stability of Hereditary Graph Classes Under Closure Operations, Journal of Graph Theory, 2013, 74, 1
  7. 7
    Roman Kužel, Zdeněk Ryjáček, Jakub Teska, Petr Vrána, Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs, Discrete Mathematics, 2012, 312, 14, 2177

    CrossRef

  8. 8
    Weihua Yang, Hongjian Lai, Hao Li, Xiaofeng Guo, Collapsible graphs and Hamiltonian connectedness of line graphs, Discrete Applied Mathematics, 2012, 160, 12, 1837

    CrossRef

  9. 9
    Tomáš Kaiser, Petr Vrána, Hamilton cycles in 5-connected line graphs, European Journal of Combinatorics, 2012, 33, 5, 924

    CrossRef

  10. 10
    H. J. Broersma, Z. Ryjáček, P. Vrána, How Many Conjectures Can You Stand? A Survey, Graphs and Combinatorics, 2012, 28, 1, 57

    CrossRef

  11. 11
    Michael Ferrara, Timothy Morris, Paul Wenger, Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs, Journal of Graph Theory, 2012, 71, 4