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 the normal view instead:
scientific article; zbMATH DE number 2002150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8817315697669983
0 references
0.8580287098884583
0 references
0.7244122624397278
0 references
0.723307192325592
0 references
