Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\) (Q2858174)
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: Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\) |
scientific article; zbMATH DE number 6229450
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\) |
scientific article; zbMATH DE number 6229450 |
Statements
19 November 2013
0 references
complete bipartite graphs
0 references
proper total coloring
0 references
vertex strongly distinguishing total coloring
0 references
vertex strongly distinguishing total chromatic number
0 references
Vertex strongly distinguishing total colorings of complete bipartite graphs \(K_{1,n},\;K_{2,n}\) and \(K_{3,n}\) (English)
0 references
