k-factors containing and avoiding specified sets of edges

MaRDI QIDQ2469296zbMATH OpenFDO

Authors Yoshimi Egawa, Keiko Kotani

Publication date 5 February 2008

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

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
• \(\{k,r-k\}\)-factors of \(r\)-regular graphs
• A short proof of a theorem of Kano and Yu on factors in regular graphs
• 2‐factors with prescribed and proscribed edges
• scientific article; zbMATH DE number 4106904 (Why is no real title available?)
• scientific article; zbMATH DE number 3867381 (Why is no real title available?)
• \(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)