SIG-DIMENSION OF K_2,2−FREE GRAPHS

Abstract

This paper introduces an algorithmic approach to investigate into the SIG-dimension of graphs, under the sup-norm. We provide an upper bound for the SIG-dimension of graphs, without isolated vertices, which do not contain an induced subgraph isomorphic to K_2,2.