Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\)) (Q2860859)
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-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\)) |
scientific article; zbMATH DE number 6225430
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\)) |
scientific article; zbMATH DE number 6225430 |
Statements
11 November 2013
0 references
complete bipartite graphs
0 references
IE-total coloring
0 references
vertex-distinguishing IE-total coloring
0 references
vertex-distinguishing IE-total chromatic number
0 references
0 references
0.9494964
0 references
Vertex-distinguishing IE-total colorings of complete bipartite graphs \(K_{m, n}\) (\(m < n\)) (English)
0 references
