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

Hamiltonian paths and hamiltonian connectivity in graphs

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

DOI10.1016/0012-365X(93)90555-8zbMath0796.05063MaRDI QIDQ1309475

Bing Wei

Publication date: 5 September 1994

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


zbMATH Keywords

degree conditionneighborhood conditionhamiltonian connectivityhamiltonian pathshamiltonian-connected


Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)


Related Items (7)

Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ Longest cycles in 3-connected graphs ⋮ On \((2, k)\)-Hamilton-connected graphs ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Hamiltonian-connected graphs ⋮ Hamilton connectedness and the partially square graphs




Cites Work

  • Hamilton connected graphs
  • Neighbourhood unions and Hamiltonian properties in graphs
  • Hamiltonism, degree sum and neighborhood intersections




This page was built for publication: Hamiltonian paths and hamiltonian connectivity in graphs

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