k-factors containing and avoiding specified sets of edges
From MaRDI portal
Publication:2469296
zbMATH Open1142.05066MaRDI QIDQ2469296FDOQ2469296
Authors: Yoshimi Egawa, Keiko Kotani 
Publication date: 5 February 2008
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
- \(k\)-factors in regular graphs and edge-connectivity
- \(K_\ell^-\)-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
Cited In (8)
- Extending matchings to 2-factors
- On the existence of general factors in regular graphs
- 2‐factors with prescribed and proscribed edges
- A short proof of a theorem of Kano and Yu on factors in regular graphs
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(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)
