Making an H $H$‐free graph k $k$‐colorable (Q6093148)

From MaRDI portal
scientific article; zbMATH DE number 7746566
Language Label Description Also known as
English
Making an H $H$‐free graph k $k$‐colorable
scientific article; zbMATH DE number 7746566

    Statements

    Making an H $H$‐free graph k $k$‐colorable (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2023
    0 references
    extremal graph theory
    0 references
    forbidden subgraph
    0 references
    max-cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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