A characterization of graphs with given maximum degree and smallest possible matching number (Q2032746)
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 |
scientific article; zbMATH DE number 7358341
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of graphs with given maximum degree and smallest possible matching number |
scientific article; zbMATH DE number 7358341 |
Statements
A characterization of graphs with given maximum degree and smallest possible matching number (English)
0 references
14 June 2021
0 references
matching number
0 references
factor-critical graph
0 references
maximum degree
0 references
0 references
