On the perfect matchings of near regular graphs

DOI10.1007/s00373-010-1008-8zbMath1234.05189OpenAlexW1999019544MaRDI QIDQ659743

Xin Min Hou

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-1008-8

zbMATH Keywords

regular graphperfect matchingnear regular graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

The number of disjoint perfect matchings in semi-regular graphs ⋮ On the chromatic edge stability index of graphs ⋮ On 2-factors with a bounded number of odd components ⋮ On a problem of potentially pancyclic-graphic sequences due to S.B. Rao

Cites Work

• Unnamed Item
• Factorizations of regular graphs of high degree
• Maximum matchings in a regular graph of specified connectivity and bounded order
• The Factorization of Linear Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: On the perfect matchings of near regular graphs