Matching Extendabilities of <i>G</i> = <i>C<sub>m</sub></i> ∨ <i>P<sub>n</sub></i>
A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of <i>G</i> is included in a perfect matching of <i>G</i>. The induced-matching extendability and bipartite-matching extendability of graphs...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-10-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/7/10/941 |