Toughness, minimum degree, and spanning cubic subgraphs

DOI10.1002/JGT.10149zbMATH Open1033.05065OpenAlexW4230762496MaRDI QIDQ4458596FDOQ4458596

D. Bauer, E. Schmeichel, Thomas Niessen

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)

Cites Work

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

Cited In (3)

• Toughness in graphs -- a survey
• Title not available (Why is that?)
• Title not available (Why is that?)

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)