Colouring square-free graphs without long induced paths. (Q3304134)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Colouring square-free graphs without long induced paths.
scientific article

    Statements

    0 references
    0 references
    0 references
    5 August 2020
    0 references
    graph colouring
    0 references
    hereditary graph class
    0 references
    clique-width
    0 references
    cycle
    0 references
    path
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Colouring square-free graphs without long induced paths. (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references