The distinguishing chromatic number of bipartite graphs of girth at least six (Q5122711)
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: The distinguishing chromatic number of bipartite graphs of girth at least six |
scientific article; zbMATH DE number 7251245
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The distinguishing chromatic number of bipartite graphs of girth at least six |
scientific article; zbMATH DE number 7251245 |
Statements
23 September 2020
0 references
distinguishing number
0 references
distinguishing chromatic number
0 references
symmetry breaking
0 references
math.CO
0 references
