Highly edge‐connected regular graphs without large factorizable subgraphs
From MaRDI portal
Publication:6056797
DOI10.1002/jgt.22729zbMath1522.05256arXiv1912.09704OpenAlexW3195289762MaRDI QIDQ6056797
Davide Mattiolo, Eckhard Steffen
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.09704
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
Cites Work