On classes of minimal circular-imperfect graphs (Q2482095)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On classes of minimal circular-imperfect graphs
scientific article

    Statements

    On classes of minimal circular-imperfect graphs (English)
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    The authors prove the following results: {\parindent=5mm \begin{itemize} \item[1.]Let \(K_{p/q}\) be any prime circular clique. Then norm \((K_{p/q})\) is \begin{itemize} \item[(i)]circular-imperfect if and only if \(p\not\equiv-1\pmod q\) and \(\lfloor p/q\rfloor\geq 3\); \item[(ii)]minimal circular-imperfect if and only if \(p= 3q+ 1\) and \(q\geq 3\); \item[(iii)] isomorphic to \(\overline K_{p/3}\) if \(p= 3q+ 1\) and \(q\geq 3\). \end{itemize} \item[2.]All partitionable graphs apart from circular cliques are circular-imperfect. \item[3.]Outerplanar graphs are circular-perfect. \item[4.]The complete join \(G*G'\) of two graphs \(G\) and \(g'\) is \begin{itemize} \item[(i)]circular-perfect if and only if both \(G\) and \(G'\) are perfect; \item[(ii)]minimal circular-imperfect if and only if \(G\) is an odd hole or odd antihole and \(G'\) is a single vertex (or vice versa), that is if and only if \(G*G'\) is an odd wheel or an odd antiwheel. \end{itemize} \end{itemize}}
    0 references
    circular coloring
    0 references
    circular-perfection
    0 references
    minimal circular-imperfect graph
    0 references
    0 references

    Identifiers