Structuring the elementary components of graphs having a perfect internal matching. (Q1874391): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:50, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Structuring the elementary components of graphs having a perfect internal matching. |
scientific article |
Statements
Structuring the elementary components of graphs having a perfect internal matching. (English)
0 references
25 May 2003
0 references
Graph matching
0 references
Alternating path
0 references
Elementary graph
0 references
Canonical partition
0 references
