A characterization of well-indumatchable graphs having girth greater than seven (Q2172407)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of well-indumatchable graphs having girth greater than seven |
scientific article |
Statements
A characterization of well-indumatchable graphs having girth greater than seven (English)
0 references
15 September 2022
0 references
matching
0 references
induced matching
0 references
distance 2 matching
0 references
strong matching
0 references
equimatchable graphs
0 references
well-indumatchable graphs
0 references
girth
0 references
leaf
0 references
stem
0 references
single star
0 references
double star
0 references
strong edge coloring
0 references
strong chromatic index
0 references
co-NP-completeness
0 references
