k-factors in regular graphs and edge-connectivity
From MaRDI portal
Publication:950664
zbMATH Open1158.05051MaRDI QIDQ950664FDOQ950664
Publication date: 3 November 2008
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
- \(k\) -factors in regular graphs
- Regular factors of regular graphs
- \(k\)-factors containing and avoiding specified sets of edges
- Regular factors in regular graphs
- \([a,b]\)-factors containing a given \(k\)-regular subgraph
- scientific article; zbMATH DE number 4055663
- Regular factors in vertex-deleted subgraphs of regular graphs
- scientific article; zbMATH DE number 1051287
- scientific article; zbMATH DE number 29671
- Pan-factorial property in regular graphs
Cited In (17)
- Factorizations of regular graphs
- \(k\)-regular factors and semi-\(k\)-regular factors in graphs
- \(k\) -factors in regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(k\)-factors containing and avoiding specified sets of edges
- Cut-edges and regular factors in regular graphs of odd degree
- Title not available (Why is that?)
- Highly edge‐connected regular graphs without large factorizable subgraphs
- \(k\)-regular factors and semi-\(k\)-regular factors in bipartite graphs
- Title not available (Why is that?)
- r-Regular, r-connected decompositions of complete graphs
- Regular factors in K1,n free graphs
- Title not available (Why is that?)
- Two-edge-connected \([2,k]\)-factors in graphs
- Title not available (Why is that?)
This page was built for publication: \(k\)-factors in regular graphs and edge-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950664)
