ISSN 0253-2778

CN 34-1054/N

open

Cycle lengths in graphs of chromatic number five and six

    Abstract
  • A problem was proposed by Moore and West to determine whether every (k+1)-critical non-complete graph has a cycle of length 2 modulo k. We prove a stronger result that for k=4, 5, every (k+1)-critical non-complete graph contains cycles of all lengths modulo k.
    • FullText(HTML)
  • loading
    • References (10)
    • Related Articles
  • Track Citations

Catalog

    Get Citation
    {{if article.pdfAccess}}
    {{if article.articleBusiness.pdfLink && article.articleBusiness.pdfLink != ''}} {{else}} {{/if}}PDF
    {{/if}}
    XML
    TrendMD

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return