Combinatorial properties of strong quasi-n-partite graphs | Synapse