The skew chromatic index of a graph (Q791534)
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 skew chromatic index of a graph |
scientific article; zbMATH DE number 3851126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The skew chromatic index of a graph |
scientific article; zbMATH DE number 3851126 |
Statements
The skew chromatic index of a graph (English)
0 references
1984
0 references
A skew edge colouring of a graph G is a pair of edge colourings of G such that no two edges are assigned the same unordered pair of colours. The skew chromatic index s(G) is the minimum number of colours required for a skew edge colouring of G. It is shown that s(G) is at most \(0(G)+4\). Better bounds are obtained when G is cyclic, cubic or bipartite.
0 references
skew Room squares
0 references
skew edge colouring
0 references
skew chromatic index
0 references
