Isolated Toughness and Existence of f-Factors

DOI10.1007/978-3-540-70666-3_13zbMATH Open1149.05326OpenAlexW1569611610MaRDI QIDQ3595433FDOQ3595433

Authors: Yinghong Ma, Qinglin Roger Yu 

Publication date: 28 August 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70666-3_13

Recommendations

• Isolated toughness and fractional \((g,f)\)-factors of graphs
• Isolated toughness and fractional \((g,f)\)-factors of graphs.
• Isolated toughness and existence of \([a,b]\)-factors in graphs
• On toughness and \((g,f)\)-factors in bipartite graphs
• Isolated toughness and existence of fractional \((g,f)\)-factors in graphs

Mathematics Subject Classification ID

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

Cited In (7)

• On existence of \([a,b]\)-factors avoiding given subgraphs.
• Title not available (Why is that?)
• On toughness and \((g,f)\)-factors in bipartite graphs
• Toughness and the existence of \(k\)-factors. IV
• Isolated toughness and existence of \([a,b]\)-factors in graphs
• Title not available (Why is that?)
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors

This page was built for publication: Isolated Toughness and Existence of f-Factors

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