Connected factors in K₁,n-free graphs containing an [a,b]-factor
From MaRDI portal
Publication:2433740
Let \(n\), \(a\), \(b\) be integers such that \(n \geq 3\), \(a \geq 1\) and \(a \leq b \leq a(n-2)+1\). Let \(G\) represent a connected \(K_{1,n}\)-free graph. If \(G\) has an \([a,b]\)-factor, then \(G\) has a connected \([a,b+n- \lceil b/a \rceil]\)-factor. The result is sharp: An example is given of such a \(G\) with an \([a,b]\)-factor but no connected \([a,b+n- \lceil b/a \rceil - 1]\)-factor, for \(b = ai\), \(1 \leq i \leq n-2\).
Recommendations
- Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
- scientific article; zbMATH DE number 1894980
- Connected \([a,b]\)-factors in graphs
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
- A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs
Cites work
Cited in
(7)- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
- Connected \([a,b]\)-factors in graphs
- A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
- Connected \([a,b]\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
- scientific article; zbMATH DE number 4200251 (Why is no real title available?)
- scientific article; zbMATH DE number 6475977 (Why is no real title available?)
This page was built for publication: Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433740)
