A short proof of a theorem of Kano and Yu on factors in regular graphs

zbMATH Open1120.05073MaRDI QIDQ2372895FDOQ2372895

Authors: Lutz Volkmann 

Publication date: 16 July 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127894

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Pan-factorial property in regular graphs
• \(\{k,r-k\}\)-factors of \(r\)-regular graphs
• Regular factors in regular graphs
• \(k\) -factors in regular graphs
• \(k\)-factors containing and avoiding specified sets of edges

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (1)

• Pan-factorial property in regular graphs

This page was built for publication: A short proof of a theorem of Kano and Yu on factors in regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372895)