On the perfect matchings of near regular graphs

DOI10.1007/S00373-010-1008-8MaRDI QIDQ659743zbMATHOpenAlexFDO

Authors Xinmin 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

perfect matchingregular graphnear regular graph

Mathematics Subject Classification ID

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

Recommendations

• The number of disjoint perfect matchings in semi-regular graphs
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• On perfect \(k\)-matchings
• Maximum matchings in a regular graph of specified connectivity and bounded order
• Perfect matchings in regular bipartite graphs

Cites work

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

Cited in

(16)

• On perfect \(k\)-matchings
• scientific article; zbMATH DE number 1792647 (Why is no real title available?)
• The number of perfect matchings, and the nesting properties, of random regular graphs
• On the structure of graphs with exactly two near-perfect matchings.
• Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs
• Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
• Results and open problems in matchings in regular graphs
• Smallest close to regular bipartite graphs without an almost perfect matching
• On 2-factors with a bounded number of odd components
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• On a problem of potentially pancyclic-graphic sequences due to S.B. Rao
• scientific article; zbMATH DE number 2104839 (Why is no real title available?)
• Perfect matchings in highly cyclically connected regular graphs
• On the chromatic edge stability index of graphs
• The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
• The number of disjoint perfect matchings in semi-regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659743)