JOURNAL ARTICLE
The number of disjoint perfect matchings in semi-regular graphs
Year: 2016 Journal: Applicable Analysis and Discrete Mathematics Vol: 11 (1)Pages: 11-38 Publisher: University of Belgrade
Abstract
We obtain a sharp result that for any even n ? 34, every {Dn,Dn+1}-regular graph of order n contains ?n/4? disjoint perfect matchings, where Dn = 2?n/4?-1. As a consequence, for any integer D ? Dn, every {D, D+1}- regular graph of order n contains (D-?n/4?+1) disjoint perfect matchings.
Keywords:
Mathematics Combinatorics Disjoint sets Graph Perfect graph theorem Trivially perfect graph Discrete mathematics Perfect power Integer (computer science) Line graph Pathwidth Computer science
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
18
Refs
0.16
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Limits and Structures in Graph Theory
Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Graph theory and applications
Physical Sciences → Mathematics → Geometry and Topology
Related Documents
JOURNAL ARTICLE
Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
Journal: Linear Algebra and its Applications Year: 2025 Vol: 726 Pages: 359-370
JOURNAL ARTICLE
Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Yulai MaDavide MattioloEckhard SteffenIsaak H. Wolf
Journal: COMBINATORICA Year: 2023 Vol: 44 (2)Pages: 429-440
JOURNAL ARTICLE
On the number of disjoint perfect matchings of regular graphs with given edge connectivity
Journal: Discrete Mathematics Year: 2016 Vol: 340 (3)Pages: 305-310
JOURNAL ARTICLE
Perfect Matchings in $\epsilon$-regular Graphs
Noga AlonVojtěch RödlAndrzej Ruciński
Journal: The Electronic Journal of Combinatorics Year: 1998 Vol: 5 (1)
JOURNAL ARTICLE
Perfect Matchings of Regular Bipartite Graphs
Journal: Journal of Graph Theory Year: 2016 Vol: 85 (2)Pages: 525-532