scientific article; zbMATH DE number 1117461

DOI10.1002/(SICI)1097-0118(199801)27:1%3C1::AID-JGT1%3E3.0.CO;2-UMaRDI QIDQ4376498zbMATH OpenFDO

Authors Yanjun Li, Mao-Cheng Cai

Publication date 6 July 1998

Full work available at URL https://doi.org/10.1002/(SICI)1097-0118(199801)27:1%3C1::AID-JGT1%3E3.0.CO;2-U

zbMATH Keywords

\([a,b\)-factor]connected factordegree condition

Mathematics Subject Classification ID

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

Recommendations

• Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• \([a,b]\)-factors with given edges in graphs.
• scientific article; zbMATH DE number 1790881

Cited in

(27)

• More sufficient conditions for a graph to have factors
• A new degree condition for graphs to have \([a,b]\)-factor
• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
• Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors
• A degree condition for fractional (g, f, n)-critical covered graphs
• Spectral radius and \([a,b]\)-factors in graphs
• Nontrivial path covers of graphs: existence, minimization and maximization
• Neighborhood union conditions for fractional \([a, b]\)-covered graphs
• Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
• A degree condition for a graph to have \((a,b)\)-parity factors
• Degree conditions for graphs to be fractional (a, b, n)-critical graphs
• Fan-type results for the existence of [\(a\),\(b\)]-factors
• K₅^--factor in a graph.
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
• scientific article; zbMATH DE number 1894980 (Why is no real title available?)
• \([a,b]\)-factors with given edges in graphs.
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• scientific article; zbMATH DE number 969172 (Why is no real title available?)
• A degree condition for graphs having all \((a, b)\)-parity factors
• The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
• Spectral condition for k-factor-criticality in t-connected graphs
• Sufficient conditions for k-factors and spanning trees of graphs
• Spectral radius and fractional \([a, b]\)-factor of graphs
• Eigenvalues and factors: a survey
• Spectral radius and parity \([a,b]\)-factors in graphs
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication:

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