Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\)) (Q2919752)
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 edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\)) |
scientific article; zbMATH DE number 6090545
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\)) |
scientific article; zbMATH DE number 6090545 |
Statements
5 October 2012
0 references
complete graph of even order
0 references
vertex distinguishing edge coloring
0 references
fan
0 references
vertex distinguishing edge chromatic number
0 references
Vertex-distinguishing edge coloring of \(K_{2n} \backslash E (F_4)\) (\(n\geq 12\)) (English)
0 references
