Regular factors in regular graphs
From MaRDI portal
The author shows that a \(k\)-regular \((k-1)\)-edge-connected graph with an even number of vertices has an \(m\)-factor not containing \(k-m\) arbitrarily prescribed edges whenever \(1\leq m\leq k-1\). This was known only for \(m=1\) or \(k-1\). Also the sharpness of this result and some corollaries are given.
Recommendations
- Regular factors of regular graphs
- scientific article; zbMATH DE number 3904628
- Factors of regular graphs
- scientific article; zbMATH DE number 2197948
- Regular factors in nearly regular graphs
- Regular factors in regular multipartite graphs
- Regular factors in regular multipartite graphs
- Factorizations of regular graphs
- Factorizing regular graphs
- Regular factors and eigenvalues of regular graphs
Cites work
Cited in
(32)- Factors of regular graphs
- Regular factors in vertex-deleted subgraphs of regular graphs
- Regular factors of simple regular graphs and factor-spectra
- Regular graphs, regular factors, and the impact of Petersen's theorems
- A short proof of a theorem of Kano and Yu on factors in regular graphs
- On zero-sum \(\mathbb Z_{2j}^k\)-magic graphs
- Pan-factorial property in regular graphs
- Cut-edges and regular factors in regular graphs of odd degree
- scientific article; zbMATH DE number 3884203 (Why is no real title available?)
- scientific article; zbMATH DE number 3843796 (Why is no real title available?)
- scientific article; zbMATH DE number 3851151 (Why is no real title available?)
- scientific article; zbMATH DE number 3867381 (Why is no real title available?)
- Factors in a class of regular digraphs
- scientific article; zbMATH DE number 33169 (Why is no real title available?)
- scientific article; zbMATH DE number 1051287 (Why is no real title available?)
- Note on parity factors of regular graphs
- Regular Graphs of High Degree are 1-Factorizable
- Fractional -factors in regular graphs
- scientific article; zbMATH DE number 2197948 (Why is no real title available?)
- Highly edge‐connected regular graphs without large factorizable subgraphs
- Perfect matchings in highly cyclically connected regular graphs
- Maximally edge‐connected realizations and Kundu's k k‐factor theorem
- Matching extension and matching exclusion via the size or the spectral radius of graphs
- The existence of even regular factors of regular graphs on the number of cut edges
- On a conjecture that strengthens Kundu's k-factor theorem
- Regular factors of line graphs
- Regular factors in nearly regular graphs
- Factorizations of regular graphs
- Even regular factor of regular graphs and number of cut edges
- \(k\) -factors in regular graphs
- \(k\)-factors in regular graphs and edge-connectivity
- Non-separating 2-factors of an even-regular graph
This page was built for publication: Regular factors in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366028)
