class of graphs with few cliques (Q6672147)

From MaRDI portal





graph class where every member has a polynomial number of maximal cliques
Language Label Description Also known as
English
class of graphs with few cliques
graph class where every member has a polynomial number of maximal cliques

    Statements

    Identifiers

    0 references