k-factors containing and avoiding specified sets of edges
The authors generalize a result of \textit{R. E. L. Aldred, D. Holton} and \textit{J. Sheehan} on the existence of a 2-factor in an \(r\)-regular \(r\)-edge connected graph satisfying some conditions [J. Graph Theory 49, 48--58 (2005; Zbl 1062.05117)]. Let \(r\), \(k\) be integers with \(k\geq 1\) and \(r \geq 2k\), and let \(G_0\) be an \(r\)-regular \(r\)-edge connected graph with \(k|V (G_0 )|\) even. Let \(A, B\) be subsets of \(E(G_0 )\) with \(A \cap B =\phi\) such that \(|A|\) and \(|B|\) satisfy one of the following three conditions. {\parindent=6mm \begin{itemize}\item[(a)]\(k/2 < |A|\leq k\) and \(|A| + |B|\leq k\); \item[(b)]\(1\leq |A|\leq k/2\) and \(|A| + |B|\leq \lceil r/2\rceil \); or \item[(c)]\(|A| = 0\) and \(|B|\leq r - k\). \end{itemize}} Under these assumptions, it is shown that \(G_0\) has a \(k\)-factor \(F\) with \(E(F )\supset A\) and \(E(F )\cap B = \phi\), unless \((G_0 ; A, B)\) belongs to an exceptional family of triples.
- \(k\)-factors in regular graphs and edge-connectivity
- K_^--factors in graphs
- Connected \([k,k+1]\)-factors of graphs
- \(k\) -factors in regular graphs
- Two-edge-connected \([2,k]\)-factors in graphs
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph
- scientific article; zbMATH DE number 7448387
- \([a,b]\)-factors containing a given \(k\)-regular subgraph
- k -Factors and Neighbourhoods of Independent Sets in Graphs
- \(k\)-factor and \(l\)-closure in graphs
- A short proof of a theorem of Kano and Yu on factors in regular graphs
- Extending matchings to 2-factors
- scientific article; zbMATH DE number 3867381 (Why is no real title available?)
- scientific article; zbMATH DE number 4106904 (Why is no real title available?)
- 2‐factors with prescribed and proscribed edges
- On the existence of general factors in regular graphs
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- \(k\)-factors in regular graphs and edge-connectivity
This page was built for publication: \(k\)-factors containing and avoiding specified sets of edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2469296)
