On the largest reduced neighborhood clique cover number of a graph

zbMath1360.05165arXiv1606.02370MaRDI QIDQ2971258

Farhad Shahrokhi

Publication date: 4 April 2017

Full work available at URL: https://arxiv.org/abs/1606.02370

zbMATH Keywords

\(t\)-shallow minorspolynomial bounded neighborhood clique

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

This page was built for publication: On the largest reduced neighborhood clique cover number of a graph