On the largest reduced neighborhood clique cover number of a graph (Q2971258)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the largest reduced neighborhood clique cover number of a graph
scientific article

    Statements

    0 references
    4 April 2017
    0 references
    \(t\)-shallow minors
    0 references
    polynomial bounded neighborhood clique
    0 references
    math.CO
    0 references

    Identifiers

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