The gap between the minimal dimension of orthonormal labeling and the size of the smallest clique covering of graph

Publication date: 5 February 2007

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

zbMATH Keywords

independent set NP-complete

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: The gap between the minimal dimension of orthonormal labeling and the size of the smallest clique covering of graph