A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406): Difference between revisions
From MaRDI portal
Changed an Item |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
A characterization of Konig-Egervary graphs using a common property of all maximum matchings | |||
| Property / arXiv classification | |||
cs.DM | |||
| Property / arXiv classification: cs.DM / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
math.CO | |||
| Property / arXiv classification: math.CO / rank | |||
Normal rank | |||
Revision as of 10:43, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of Konig-Egervary graphs using a common property of all maximum matchings |
scientific article |
Statements
1 November 2013
0 references
cs.DM
0 references
math.CO
0 references
