On maximal matchings of connected graphs
DOI10.1016/S0252-9602(17)30243-6zbMATH Open1082.05074OpenAlexW2784090705MaRDI QIDQ812460FDOQ812460
Authors: Baogang Xu 
Publication date: 24 January 2006
Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0252-9602(17)30243-6
Recommendations
- The connectivity of maximum matching graphs
- Matching and edge-connectivity in graphs with given maximum degree
- Maximum matchings in a regular graph of specified connectivity and bounded order
- Maximum matching in regular and almost regular graphs
- On maximum matchings in almost regular graphs
- Maximum matchings in regular graphs
- Maximum matchings in a class of random graphs
- Matching connectivity: on the structure of graphs with perfect matchings
- On matchings in graphs
- On maximum matchings in König-Egerváry graphs
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (13)
- Maximum matchings in a class of random graphs
- Counting maximal matchings in linear polymers
- Maximum matchings in regular graphs of high girth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterizations of maximum matching graphs of certain types
- Title not available (Why is that?)
- Maximum matchings in bipartite graphs via strong spanning trees
- Maximum matchings in geometric intersection graphs
- A note on interconnecting matchings in graphs
- Maximal matchings in graphs with large neighborhoods of independent vertices
- On maximum matchings in König-Egerváry graphs
- Polynomial reconstruction of the matching polynomial
This page was built for publication: On maximal matchings of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812460)
