Partitioning a graph into two isomorphic pieces (Q4434545)
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: Partitioning a graph into two isomorphic pieces |
scientific article; zbMATH DE number 2002150
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into two isomorphic pieces |
scientific article; zbMATH DE number 2002150 |
Statements
Partitioning a graph into two isomorphic pieces (English)
0 references
10 November 2003
0 references
graph
0 references
neighbour set
0 references
co-neighbour set
0 references
matching
0 references
regular graph
0 references
