Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
From MaRDI portal
Publication:6548022
DOI10.1007/S00493-023-00078-9MaRDI QIDQ6548022FDOQ6548022
Authors: Yulai Ma, Davide Mattiolo, Eckhard Steffen, Isaak H. Wolf 
Publication date: 31 May 2024
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
- On the number of disjoint perfect matchings of regular graphs with given edge connectivity
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Highly edge‐connected regular graphs without large factorizable subgraphs
- Perfect matchings in regular bipartite graphs
- Maximum matchings in a regular graph of specified connectivity and bounded order
Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Indecomposabler-graphs and some other counterexamples
- Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- Factorizing regular graphs
- Chromatic-index-critical graphs of even order
- Highly edge‐connected regular graphs without large factorizable subgraphs
This page was built for publication: Edge-connectivity and pairwise disjoint perfect matchings in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548022)
