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

DOI10.1007/s00373-012-1168-9zbMath1268.05161OpenAlexW1978322250MaRDI 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 numberminimum degree2-edge connectedeven factor

Mathematics Subject Classification ID

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

Related Items (16)

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Sufficient condition for the existence of an even \([a,b]\)-factor in graph