\(f\)-factors, complete-factors, and component-deleted subgraphs

DOI10.1016/J.DISC.2013.03.009zbMath1279.05056OpenAlexW1985815305MaRDI QIDQ392640

Kenji Kimura

Publication date: 15 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.03.009

zbMATH Keywords

\(f\)-factorcomplete-factorcomponent-deleted subgraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (6)

A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks

Cites Work

• Unnamed Item
• Complete factors and \(f\)-factors
• Factors and vertex-deleted subgraphs
• The Factors of Graphs

This page was built for publication: \(f\)-factors, complete-factors, and component-deleted subgraphs