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

Simple algorithm for finding a second Hamilton cycle

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

zbMath1330.05094MaRDI QIDQ890906

Tommy R. Jensen

Publication date: 16 November 2015

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v9/p151-155.pdf


zbMATH Keywords

cubic graphHamilton cyclelollipop algorithmparity argumentSmith theorem


Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)


Related Items (1)

A parity theorem about trees with specified degrees







This page was built for publication: Simple algorithm for finding a second Hamilton cycle

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