Results on toughness in graphs under heavy subgraph conditions

zbMATH Open1313.05214MaRDI QIDQ2924124

Wenxiao Lin, Qiang Li

Publication date: 3 November 2014

Published in: Basic Sciences Journal of Textile Universities (Search for Journal in Brave)

zbMATH Keywords

toughnessforbidden subgraphsheavy subgraphs

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42)

Recommendations

• A large class of maximally tough graphs 👍 👎
• A note on the approximability of the toughness of graphs 👍 👎
• Toughness and \((a,b,k)\)-critical graphs 👍 👎
• Toughness, forbidden subgraphs, and Hamilton-connected graphs 👍 👎
• Toughness in graphs -- a survey 👍 👎
• On the Toughness of a Graph 👍 👎
• Various results on the toughness of graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Results on toughness in graphs under heavy subgraph conditions

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