Characterization of perfect matching transitive graphs

DOI10.5614/EJGTA.2018.6.2.15MaRDI QIDQ5009998zbMATH OpenOpenAlexWikidataFDO

Authors Ju Zhou

Publication date 23 August 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2018.6.2.15

zbMATH Keywords

symmetric graphedge-transitive graphvertex-transitive graphPM-transitive graph

Mathematics Subject Classification ID

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

Recommendations

• Perfect matching transitivity of circulant graphs
• Graphs that contain multiply transitive matchings
• Dimension of the perfect matching polytope of graphs
• A characterization of PM-compact claw-free cubic graphs
• Perfect matchings in edge-transitive graphs

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 193034 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 1750091 (Why is no real title available?)
• scientific article; zbMATH DE number 227006 (Why is no real title available?)
• scientific article; zbMATH DE number 3349883 (Why is no real title available?)
• A conjecture concerning a limit of non-Cayley graphs
• A graph which is edge transitive but not arc transitive
• Cubic vertex-transitive graphs on up to 1280 vertices
• Handbook of Graph Theory
• On a closure concept in claw-free graphs
• The classification of Hamiltonian generalized Petersen graphs
• Vertex and Edge Transitive, but not 1-Transitive, Graphs

Cited in

(5)

• Graphs that contain multiply transitive matchings
• Dimension of the perfect matching polytope of graphs
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
• Automorphism groups of some families of bipartite graphs
• Perfect matching transitivity of circulant graphs

This page was built for publication: Characterization of perfect matching transitive graphs

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