Distinguishing Cartesian products of countable graphs (Q503675)
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: Distinguishing Cartesian products of countable graphs |
scientific article; zbMATH DE number 6676793
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distinguishing Cartesian products of countable graphs |
scientific article; zbMATH DE number 6676793 |
Statements
Distinguishing Cartesian products of countable graphs (English)
0 references
23 January 2017
0 references
vertex coloring
0 references
distinguishing number
0 references
automorphisms
0 references
infinite graphs
0 references
Cartesian product
0 references
weak Cartesian product
0 references
0.9172183871269226
0 references
0.880082905292511
0 references
0.8776186108589172
0 references
0.8704829216003418
0 references
0.8678146600723267
0 references
