On maximal matchings of connected graphs

DOI10.1016/S0252-9602(17)30243-6zbMATH Open1082.05074OpenAlexW2784090705MaRDI QIDQ812460

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

zbMATH Keywords

reconstruction

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Maximum matchings in a class of random graphs ⋮ Maximum matchings in regular graphs of high girth ⋮ Title not available (Why is that?) ⋮ Maximum matchings in geometric intersection graphs ⋮ Title not available (Why is that?) ⋮ On maximum matchings in König-Egerváry graphs ⋮ Characterizations of maximum matching graphs of certain types ⋮ A note on interconnecting matchings in graphs ⋮ Maximal matchings in graphs with large neighborhoods of independent vertices ⋮ Title not available (Why is that?)

Recommendations

• On maximum matchings in almost regular graphs 👍 👎
• Maximum matchings in a class of random graphs 👍 👎
• Matching connectivity: on the structure of graphs with perfect matchings 👍 👎
• Maximum matchings in regular graphs 👍 👎
• Maximum matching in regular and almost regular graphs 👍 👎
• Matching and edge-connectivity in graphs with given maximum degree 👍 👎
• On maximum matchings in König-Egerváry graphs 👍 👎
• The connectivity of maximum matching graphs 👍 👎
• On matchings in graphs 👍 👎
• Maximum matchings in a regular graph of specified connectivity and bounded order 👍 👎

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)