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

DOI10.1007/S00373-012-1168-9zbMATH Open1268.05161OpenAlexW1978322250MaRDI QIDQ354444FDOQ354444

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

Recommendations

• Stability number and even \([2,b]\)-factors in graphs
• Even [a,b]-factors in graphs
• Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
• Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
• Stability number and [a,b]‐factors in graphs

zbMATH Keywords

minimum degreestability number2-edge connectedeven factor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (19)

• Path-factor critical covered graphs and path-factor uniform graphs
• Neighborhood union conditions for fractional \([a, b]\)-covered graphs
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• Spectral radius conditions for fractional \([a,b]\)-covered graphs
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• Eigenvalues and [a,b]‐factors in regular graphs
• AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
• Research on fractional critical covered graphs
• An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
• The existence of \(P_{\geq3}\)-factor covered graphs
• Path factors and neighborhoods of independent sets in graphs
• A sufficient condition for a bipartite graph to have a k‐factor
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Sharp conditions for the existence of an even $[a,b]$-factor in a graph
• 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 existence theorem on Hamiltonian (g,f)-factors in networks
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354444)