A neighbourhood condition for graphs to have [a,b]-factors

DOI10.1016/S0012-365X(00)00140-0MaRDI QIDQ1586781zbMATH OpenFDO

Authors Haruhide Matsuda

Publication date 16 August 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00140-0

zbMATH Keywords

degreefactor

Mathematics Subject Classification ID

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

Review text

Let \(a\) and \(b\) be integers such that \(1\leq a\leq b\). An \([a,b]\)-factor of a graph \(G\) is defined as a spanning subgraph \(F\) of \(G\) such that \(a\leq\deg_F(x)\leq b\) for all vertices \(x\). The note shows that \(G\) has an \([a,b]\)-factor if the minimum degree \(\delta(x)\geq a\), \(n\geq 2(a+b)(a+ b-1)/b\) and \(|N_G(x)\cup N_G(y)|\geq an/(a+ b)\) for any two non-adjacent vertices \(x\) and \(y\) of \(G\).

Recommendations

• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
• A neighborhood condition for graphs to have \([a, b]\)-factors. II
• scientific article; zbMATH DE number 1501177
• A Neighborhood Condition for Graphs to Have [a, b]-Factors III
• scientific article; zbMATH DE number 1910915

Cited in

(27)

• A new degree condition for graphs to have \([a,b]\)-factor
• On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Research on fractional critical covered graphs
• 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
• On all fractional \({(a,b,k)}\)-critical graphs
• Fan-type results for the existence of [\(a\),\(b\)]-factors
• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph
• A neighborhood condition for graphs to have (g,f)-factors.
• A neighborhood condition for the existence of \([a,b]\)-factors
• scientific article; zbMATH DE number 5007932 (Why is no real title available?)
• Neighborhood union for \([a,b]\)-\(k\)-uniform graphs
• Independence number and minimum degree for \([a,b]\)-factors
• scientific article; zbMATH DE number 1117461 (Why is no real title available?)
• scientific article; zbMATH DE number 1145229 (Why is no real title available?)
• scientific article; zbMATH DE number 1790881 (Why is no real title available?)
• scientific article; zbMATH DE number 1910915 (Why is no real title available?)
• \([a,b]\)-factors with given edges in graphs.
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• Degree conditions for graphs to have \([a, b\)]-factors containing a given 2-factor
• A degree condition for graphs having all \((a, b)\)-parity factors
• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: A neighbourhood condition for graphs to have \([a,b]\)-factors

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