Sufficient condition for the existence of an even [a,b]-factor in graph
From MaRDI portal
Publication:354444
Recommendations
Cites work
- scientific article; zbMATH DE number 1933054 (Why is no real title available?)
- scientific article; zbMATH DE number 1501962 (Why is no real title available?)
- Connected factors in graphs -- a survey
- Even [a,b]-factors in graphs
- Factors and factorizations of graphs—a survey
- Graph factors
- Graph factors and factorization: 1985--2003: a survey
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Independence number, connectivity, and r‐factors
- Spanning trees with bounded degrees
- Stability number and [a,b]‐factors in graphs
- Stability number and even \([2,b]\)-factors in graphs
- Subgraphs with prescribed valencies
- The stability number and connected \([k,k+1]\)-factor in graphs
Cited in
(20)- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Path-factor critical covered graphs and path-factor uniform graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- 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 existence theorem on Hamiltonian \((g,f)\)-factors in networks
- Research on fractional critical covered graphs
- AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN 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
- Stability number and even \([2,b]\)-factors in 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
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)
