On the Toughness of Cycle Permutation Graphs

DOI10.1023/A:1013786612087MaRDI QIDQ2760959zbMATH OpenOpenAlexFDO

Authors Shaocen Han, Chong-Yun Chao

Publication date 16 December 2001

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/30632

zbMATH Keywords

cycle permutation graphmaximal chaintoughness

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• The toughness of cubic graphs
• Toughness and edge-toughness
• scientific article; zbMATH DE number 5856
• scientific article; zbMATH DE number 434902
• Toughness, minimum degree, and the existence of 2‐factors

Cites work

• scientific article; zbMATH DE number 21737 (Why is no real title available?)
• scientific article; zbMATH DE number 151660 (Why is no real title available?)
• scientific article; zbMATH DE number 554161 (Why is no real title available?)
• scientific article; zbMATH DE number 5856 (Why is no real title available?)
• scientific article; zbMATH DE number 861394 (Why is no real title available?)
• scientific article; zbMATH DE number 867682 (Why is no real title available?)
• On the algebraic theory of graph colorings
• On the classification and toughness of generalized permutation star-graphs
• The toughness of cubic graphs
• Tough graphs and Hamiltonian circuits.

Cited in

(5)

• The splicing of cycle permutation graphs
• The toughness of cubic graphs
• Toughness in graphs -- a survey
• On the classification and toughness of generalized permutation star-graphs
• scientific article; zbMATH DE number 5856 (Why is no real title available?)

This page was built for publication: On the Toughness of Cycle Permutation Graphs

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