Complexity of products of even cycles (Q2908703)

From MaRDI portal





scientific article; zbMATH DE number 6077131
Language Label Description Also known as
English
Complexity of products of even cycles
scientific article; zbMATH DE number 6077131

    Statements

    0 references
    5 September 2012
    0 references
    outerplanar crossing numbrer and skewness
    0 references
    average crossig number
    0 references
    matching book thickness
    0 references
    cartesian product
    0 references
    Complexity of products of even cycles (English)
    0 references
    Drawings of the Cartesian product \(C_r \times C_s\) of cycles or length \(r\) and \(s\) are considered. It is shown that the \textit{outerplanar crossing number} \(\nu_1(C_r \times C_s) \leq 4r^3 + 6r^2 - 8r\). The \textit{matching book thickness} \(\text{mbt}(G)\) is the minimum number of colors in an edge coloring of a layout of \(G\) such that same colored edges do not cross or are incident. It is shown that \(\text{mbt}(C_r \times C_s) = 4\) if both \(r\) and \(s\) are even and is \(5\) if precisely one of \(r\) or \(s\) is odd.
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references