Structuring the elementary components of graphs having a perfect internal matching. (Q1874391)
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: Structuring the elementary components of graphs having a perfect internal matching. |
scientific article; zbMATH DE number 1915569
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Structuring the elementary components of graphs having a perfect internal matching. |
scientific article; zbMATH DE number 1915569 |
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
