Toughness, minimum degree, and spanning cubic subgraphs

DOI10.1002/JGT.10149MaRDI QIDQ4458596zbMATH OpenOpenAlexFDO

Authors Thomas Niessen, E. Schmeichel, D. Bauer

Publication date 15 March 2004

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10149

zbMATH Keywords

toughnessminimum vertex degree3-factors

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Various results on the toughness of graphs
• Toughness, minimum degree, and the existence of 2‐factors
• The complexity of recognizing tough cubic graphs
• The toughness of cubic graphs
• scientific article; zbMATH DE number 4008429

Cites work

• Reguläre Faktoren von Graphen.
• The Factors of Graphs
• Toughness, minimum degree, and the existence of 2‐factors

Cited in

(4)

• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• scientific article; zbMATH DE number 1934400 (Why is no real title available?)
• Toughness and vertex degrees

This page was built for publication: Toughness, minimum degree, and spanning cubic subgraphs

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