On toughness and [a,b]-factors

zbMATH Open1270.05064MaRDI QIDQ2839732FDOQ2839732

Authors: Qiuju Bian 

Publication date: 12 July 2013

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

\(k\)-factorfinite undirected graph

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (3)

• Toughness and the existence of \(k\)-factors. IV
• Title not available (Why is that?)
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors

This page was built for publication: On toughness and \([a,b]\)-factors

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