48
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to clawsFootnote

&
Pages 135-141 | Received 22 Sep 2006, Accepted 20 Mar 2007, Published online: 27 Oct 2009

References

  • Aider , M . 2002 . Almost distance-hereditary graphs . Discrete Math. , 242 : 1 – 16 .
  • Bollobás , B and Brightwell , G . 1993 . Cycles through specified vertices . Combinatorica , 13 : 147 – 155 .
  • Bondy , JA and Chvátal , V . 1976 . A method in graph theory . Discrete Math. , 15 : 111 – 135 .
  • Bondy , JA and Murty , USR . 1976 . Graph Theory with Applications , London and Basingstoke : The Macmillan Press Ltd. .
  • Broersma , HJ and Veldman , HJ . 1990 . “ Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K 1,3-free graphs ” . In Contemporary Methods in Graph Theory , Edited by: Bodendiek , R . 181 – 194 . Mannheim-Wien-Zürich : BI-Wiss.-Verl. .
  • Broersman , HJ , Ryjáček , Z and Schiermeyer , I . 1997 . Dirac's minimum degree condition restricted to claws . Discrete Math. , 167 : 155 – 166 .
  • Faudree , RJ , Ryjáček , Z and Schiermeyer , I . 1995 . Forbidden subgraphs and cycle extendability . J. Combin. Math. Combin. Comput. , 19 : 109 – 128 .
  • Feng , J and Guo , Y . 2004 . Hamiltonian problem on claw-free and almost distance-hereditary graphs . Discrete Math. , to appear
  • Hsieh , S , Ho , C , Hsu , T and Ko , M . 2002 . “ A linear time algoritheorem for Hamiltonian problem on distance-hereditary graphs ” . In Proc. 19th Workshop Combinatorial Math. Comput. Theory 8 – 11 .
  • Shi , R . 1992 . 2-Neighborhoods and Hamiltonian conditions . J. Graph Theory , 16 : 267 – 271 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.