Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
The number of Hamiltonian circuits in large, heavily edged graphs - MaRDI portal

The number of Hamiltonian circuits in large, heavily edged graphs

From MaRDI portal

Publication:4103122

Jump to:navigation, search

DOI10.1017/S0017089500003001zbMath0336.05111MaRDI QIDQ4103122

E. M. Wright, John Sheehan

Publication date: 1977

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

For How Many Edges is a Graph Almost Certainly Hamiltonian?

This page was built for publication: The number of Hamiltonian circuits in large, heavily edged graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4103122&oldid=17872186"