Highly edge-connected regular graphs without large factorizable subgraphs
暂无分享，去创建一个
We construct highly edge-connected $r$-regular graph which do not contain $r-2$ pairwise disjoint perfect matchings. The results partially answer a question stated by Thomassen [Factorizing regular graphs, J. Comb. Theory Ser. B (2019), this https URL (article in press)].
[1] Giuseppe Mazzuoccolo. An Upper Bound for the Excessive Index of an r-Graph , 2013, J. Graph Theory.
[2] Carsten Thomassen. Factorizing regular graphs , 2020, J. Comb. Theory, Ser. B.
[3] Romeo Rizzi. Indecomposable r-graphs and some other counterexamples , 1999 .
[4] G. Meredith. Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs , 1973 .