Binding numbers and connected factors

DOI10.1007/S00373-010-0953-6zbMath1207.05159OpenAlexW2005371816MaRDI QIDQ607686

Yunsun Nam

Publication date: 3 December 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0953-6

zbMATH Keywords

\([a,b\)-factor]binding numberconnected factor

Mathematics Subject Classification ID

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

Related Items (7)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS] ⋮ Path factors in subgraphs ⋮ Binding number and path-factor critical deleted graphs ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
• Connected \([k,k+1\)-factors of graphs]
• Connected \([a,b\)-factors in graphs]
• Connected (g, f)-factors
• Binding number and minimum degree for k-factors
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Hamiltonian ?-factors in graphs
• Toughness, trees, and walks
• Ore‐type condition for the existence of connected factors
• A \([k,k+1\)-factor containing a given Hamiltonian cycle]

This page was built for publication: Binding numbers and connected factors