Sufficient condition for the existence of an even \([a,b]\)-factor in graph

DOI10.1007/s00373-012-1168-9zbMath1268.05161MaRDI QIDQ354444

Mekkia Kouider, Saliha Ouatiki

Publication date: 19 July 2013

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

Full work available at URL: https://doi.org/10.1007/s00373-012-1168-9

zbMATH Keywords

stability number; minimum degree; 2-edge connected; even factor

Mathematics Subject Classification ID

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

Related Items

Sharp conditions for the existence of an even $[a,b$-factor in a graph], An existence theorem on Hamiltonian (g,f)-factors in networks, Eigenvalues and [a,b‐factors in regular graphs], Path factors and neighborhoods of independent sets in graphs, A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs], A degree condition for fractional \([a,b\)-covered graphs], Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors], An odd \([ 1 , b \)-factor in regular graphs from eigenvalues], Research on fractional critical covered graphs, Nash-Williams conditions for the existence of all fractional \([a,b\)-factors], Neighborhood union conditions for fractional \([a, b\)-covered graphs], The existence of \(P_{\geq3}\)-factor covered graphs, Two sufficient conditions for odd \([1,b\)-factors in graphs], Spectral radius conditions for fractional \([a,b\)-covered graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• Stability number and even \([2,b\)-factors in graphs]
• Graph factors and factorization: 1985--2003: a survey
• The stability number and connected \([k,k+1\)-factor in graphs]
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Graph factors
• Spanning trees with bounded degrees
• Connected factors in graphs -- a survey
• Factors and factorizations of graphs—a survey
• Even [a,b-factors in graphs]
• Independence number, connectivity, and r‐factors
• Stability number and [a,b‐factors in graphs]
• Subgraphs with prescribed valencies