Minimum degree, independence number and regular factors

DOI10.1007/BF01787816zbMath0844.05056MaRDI QIDQ1906860

Thomas Niessen

Publication date: 24 January 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

independence numberlower boundminimum degreeregular factor

Mathematics Subject Classification ID

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

Related Items (2)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ On pseudo 2-factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum degree of a graph and the existence of k-factors
• Toughness and the existence of k-factors. II
• An Ore-type condition for the existence of \(k\)-factors in graphs
• Spanning subgraphs with specified valencies
• Long cycles in graphs with prescribed toughness and minimum degree
• A note on Hamiltonian circuits
• Binding number and minimum degree for k-factors
• Toughness and the existence ofk-factors
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• A degree condition for the existence ofk-factors
• The Subgraph Problem
• Toughness, minimum degree, and the existence of 2‐factors
• Neighborhood unions and regular factors
• Independence number, connectivity, and r‐factors
• The Factorization of Linear Graphs
• Reguläre Faktoren von Graphen.
• The Factors of Graphs

This page was built for publication: Minimum degree, independence number and regular factors