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
On Path-Tough Graphs - MaRDI portal

On Path-Tough Graphs

From MaRDI portal

Publication:4317702

Jump to:navigation, search

DOI10.1137/S0895480192242766zbMath0824.05041MaRDI QIDQ4317702

Thomas Niessen, Peter Dankelmann, Ingo Schiermeyer

Publication date: 20 December 1994

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

zbMATH Keywords

Hamiltonian 2-factor NP-complete decision problem path-tough graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Toughness in graphs -- a survey ⋮ On the pancyclicity of 1-tough graphs

This page was built for publication: On Path-Tough Graphs

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