The authors give a constructive proof of: there exists an acyclic matching (which is a conjecture of C. K. Fan and J. Losonczy (1996)).
Recommendations
- Acyclic matching in some subclasses of graphs
- Acyclic Matching in Some Subclasses of Graphs
- Acyclic matchings in subclasses of bipartite graphs
- Acyclic matchings in graphs of bounded maximum degree
- Alternating cycle-free matchings
- On matchings in graphs
- Matching graphs
- scientific article; zbMATH DE number 1953189
- Matchings of cycles and paths in directed graphs
- Induced matchings
Cited in
(11)- On matchings in groups
- On matchable subsets in abelian groups and their linear analogues
- Results and questions on matchings in abelian groups and vector subspaces of fields
- On matching property for groups and field extensions
- Conditions for matchability in groups and field extensions
- Matchings in matroids over abelian groups
- An algorithmic framework for optimizing acyclic matching in corona graphs
- Classifying abelian groups through acyclic matchings
- The weak acyclic matching property in abelian groups
- Characterization of matchable sets and subspaces via Dyson transforms
- Matchings in matroids over abelian groups. II
This page was built for publication: Acyclic matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564359)
