A characterization of well-indumatchable graphs having girth greater than seven (Q2172407)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7585592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of well-indumatchable graphs having girth greater than seven |
scientific article; zbMATH DE number 7585592 |
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
0.9115283489227296
0 references
0.8900802731513977
0 references
0.8177093863487244
0 references
0.7942665219306946
0 references
0.7930257320404053
0 references
