On Path-Tough Graphs

DOI10.1137/S0895480192242766MaRDI QIDQ4317702zbMATH OpenFDO

Authors Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer

Publication date 20 December 1994

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

Full work available at URL https://doi.org/10.1137/S0895480192242766

zbMATH Keywords

2-factordecision problemHamiltonianNP-completepath-tough graph

Mathematics Subject Classification ID

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

Recommendations

• Path partition number in tough graphs
• scientific article; zbMATH DE number 4177107
• scientific article; zbMATH DE number 434902
• On the complexity of recognizing tough graphs
• scientific article; zbMATH DE number 861334

Cited in

(4)

• Path partition number in tough graphs
• Toughness in graphs -- a survey
• DisjointT-paths in tough graphs
• On the pancyclicity of 1-tough graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4317702)