Computing the degree of some matchings in a graph
Let \(G\) be a connected graph. A matching \(M\) in \(G\) is a set of edges of \(G\) without two of them adjacent (having a common vertex). The graph whose vertices are the matchings in \(G\) and two matchings \(M\) and \(N\) are adjacent if and only if \( (M\setminus N)\cup (N\setminus M)\) is the...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Journal of Combinatorics
2024-10-01
|
| Series: | The American Journal of Combinatorics |
| Subjects: | |
| Online Access: | https://ajcombinatorics.org/ojs/index.php/AmJC/article/view/17 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|