Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Hamiltonian problem on claw-free and almost distance-hereditary graphs

From MaRDI portal
Publication:998395
Jump to:navigation, search

DOI10.1016/j.disc.2007.11.063zbMath1175.05076OpenAlexW1993149517MaRDI QIDQ998395

Jinfeng Feng, Yubao Guo

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.063


zbMATH Keywords

Hamiltonian cycledistance-hereditaryclaw-free


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)


Related Items (2)

Hamilton cycles in almost distance-hereditary graphs ⋮ Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs



Cites Work

  • Linear Time Algorithms for Hamiltonian Problems on (Claw,Net)-Free Graphs
  • Almost distance-hereditary graphs




This page was built for publication: Hamiltonian problem on claw-free and almost distance-hereditary graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:998395&oldid=29966234"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 March 2024, at 02:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki