A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A characterization of graphs with given maximum degree and smallest possible matching number. II |
scientific article; zbMATH DE number 7456590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of graphs with given maximum degree and smallest possible matching number. II |
scientific article; zbMATH DE number 7456590 |
Statements
A characterization of graphs with given maximum degree and smallest possible matching number. II (English)
0 references
13 January 2022
0 references
matching number
0 references
factor-critical
0 references
maximum degree
0 references
0 references
0 references
