Second kind maximum matching graph
From MaRDI portal
Publication:2439122
DOI10.1016/j.disc.2014.01.011zbMath1283.05221OpenAlexW2063844200MaRDI QIDQ2439122
Publication date: 7 March 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.01.011
Extremal problems in graph theory (05C35) 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)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hamiltonicity in (0-1)-polyhedra
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- Connectivity of Cartesian products of graphs
- Matching theory
- Subgraphs of maximum matching graphs
- Characterizations of maximum matching graphs of certain types
- Z-transformation graphs of perfect matchings of hexagonal systems
- Matching graphs
- Paths, Trees, and Flowers
This page was built for publication: Second kind maximum matching graph