Highly edge-connected regular graphs without large factorizable subgraphs

D. Mattiolo, E. Steffen, ArXiv:1912.09704 (2019).

Download
No fulltext has been uploaded.
Preprint | English
Author
;
Abstract
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), https://doi.org/10.1016/j.jctb.2019.05.002 (article in press)].
Publishing Year
Journal Title
arXiv:1912.09704
LibreCat-ID

Cite this

Mattiolo D, Steffen E. Highly edge-connected regular graphs without large factorizable  subgraphs. arXiv:191209704. 2019.
Mattiolo, D., & Steffen, E. (2019). Highly edge-connected regular graphs without large factorizable  subgraphs. ArXiv:1912.09704.
@article{Mattiolo_Steffen_2019, title={Highly edge-connected regular graphs without large factorizable  subgraphs}, journal={arXiv:1912.09704}, author={Mattiolo, Davide and Steffen, Eckhard}, year={2019} }
Mattiolo, Davide, and Eckhard Steffen. “Highly Edge-Connected Regular Graphs without Large Factorizable  Subgraphs.” ArXiv:1912.09704, 2019.
D. Mattiolo and E. Steffen, “Highly edge-connected regular graphs without large factorizable  subgraphs,” arXiv:1912.09704. 2019.
Mattiolo, Davide, and Eckhard Steffen. “Highly Edge-Connected Regular Graphs without Large Factorizable  Subgraphs.” ArXiv:1912.09704, 2019.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar