Matching graphs

DOI10.1002/(SICI)1097-0118(199810)29:2%3C73::AID-JGT3%3E3.0.CO;2-9zbMATH Open0919.05053OpenAlexW4237159281MaRDI QIDQ4242912FDOQ4242912

Authors: Linda Eroh, Michelle Schultz 

Publication date: 31 August 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199810)29:2%3C73::aid-jgt3%3E3.0.co;2-9

Recommendations

• Characterizations of maximum matching graphs of certain types
• On matchings in graphs
• Graphs isomorphic to their maximum matching graphs
• Distance between two vertices of maximum matching graphs
• Subgraphs of maximum matching graphs

zbMATH Keywords

metric spacedistance graphmatching graph

Mathematics Subject Classification ID

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

Cited In (13)

• Second kind maximum matching graph
• Subgraphs of maximum matching graphs
• Distance between two vertices of maximum matching graphs
• Matching in Toeplitz graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph unification and matching
• Characterizations of maximum matching graphs of certain types
• Acyclic matchings
• The ultimate categorical matching in a graph
• Graphs isomorphic to their maximum matching graphs
• Quasi-best match graphs
• Combinatorial and matrix methods for graph matching

This page was built for publication: Matching graphs

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