Distance between two vertices of maximum matching graphs

DOI10.1007/S10255-004-0201-ZMaRDI QIDQ705048zbMATH OpenOpenAlexFDO

Authors Yan Liu

Publication date 25 January 2005

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-004-0201-z

zbMATH Keywords

distancealternating cyclesmaximum matching graph

Mathematics Subject Classification ID

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

Recommendations

• Subgraphs of maximum matching graphs
• Characterizations of maximum matching graphs of certain types
• The connectivity of maximum matching graphs
• Matching graphs
• On matchings in graphs

Cites work

• scientific article; zbMATH DE number 4051677 (Why is no real title available?)
• Graph theory with applications
• Hamiltonicity in (0-1)-polyhedra
• Matching graphs
• Z-transformation graphs of perfect matchings of hexagonal systems

Cited in

(7)

• scientific article; zbMATH DE number 4191716 (Why is no real title available?)
• Subgraphs of maximum matching graphs
• The structure of Eta graph with \(|V (g)| + 4\) maximum matchings
• Path-transformation graph of maximum matchings
• The connectivity of maximum matching graphs
• \(Mn\)-polynomials of theta and Wagner graphs
• Graphs isomorphic to their maximum matching graphs

This page was built for publication: Distance between two vertices of maximum matching graphs

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