On the perfect matchings of near regular graphs
From MaRDI portal
Publication:659743
DOI10.1007/S00373-010-1008-8zbMATH Open1234.05189OpenAlexW1999019544MaRDI QIDQ659743FDOQ659743
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
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
Cited In (16)
- The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
- Perfect matchings in highly cyclically connected regular graphs
- The number of disjoint perfect matchings in semi-regular graphs
- On the structure of graphs with exactly two near-perfect matchings.
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
- Title not available (Why is that?)
- On the number of disjoint perfect matchings of regular graphs with given edge connectivity
- On perfect \(k\)-matchings
- Smallest close to regular bipartite graphs without an almost perfect matching
- The number of perfect matchings, and the nesting properties, of random regular graphs
- On 2-factors with a bounded number of odd components
- Asymptotic enumeration of \(k\)-edge-colored \(k\)-regular graphs
- Results and open problems in matchings in regular graphs
- Title not available (Why is that?)
- On a problem of potentially pancyclic-graphic sequences due to S.B. Rao
- On the chromatic edge stability index of 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)
