A sufficient condition for a graph to be an (a, b, k)-critical graph

DOI10.1080/00207160902777914zbMath1198.05129MaRDI QIDQ3056357

Si-zhong Zhou

Publication date: 12 November 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160902777914

zbMATH Keywords

graph; neighborhood; \([a, b\)-factor]; \((a, b, k)\)-critical graph

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

Related Items

A sufficient condition for the existence of a k-factor excluding a given r-factor, A binding number condition for graphs to be \((a, b, k)\)-critical graphs, Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems, Randomly orthogonal factorizations with constraints in bipartite networks, Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Toughness and \((a,b,k)\)-critical graphs, Subgraphs with orthogonal factorizations in graphs, Remarks on fractional ID-\(k\)-factor-critical graphs, Degree conditions for fractional \((a,b,k)\)-critical covered graphs, Binding numbers for fractional ID-\(k\)-factor-critical graphs, STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS, A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS]

Cites Work

• Unnamed Item
• On factors with given components
• A sufficient condition for a graph to have \([a,b\)-factors]
• Toughness and the existence of \(k\)-factors. IV
• A new degree condition for graphs to have \([a,b\)-factor]
• BINDING NUMBER CONDITIONS FOR (a, b, k)-CRITICAL GRAPHS
• Some sufficient conditions for graphs to have (g, f)-factors