Independence number, connectivity, and r‐factors

DOI10.1002/JGT.3190130109zbMath0682.05053OpenAlexW2111562002MaRDI QIDQ4731218

Tsuyoshi Nishimura

Publication date: 1989

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

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

zbMATH Keywords

independence numberconnectivityfactorizationspanning subgraphr- factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (13)

Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ Minimum degree, independence number and regular factors ⋮ Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Eigenvalues and [a,b‐factors in regular graphs] ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Stability number and \(f\)-factors in graphs ⋮ An Ore-type condition for the existence of \(k\)-factors in graphs ⋮ Degree and stability number condition for the existence of connected factors in graphs ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Independence number, connectivity and \((a,b,k)\)-critical graphs ⋮ Connected \(k\)-factors in bipartite graphs

Cites Work

• Unnamed Item
• The Factors of Graphs
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Independence number, connectivity, and r‐factors