Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem

DOI10.1017/S0963548306007711zbMath1122.05033MaRDI QIDQ5295414

Dalibor Fronček, Petr Kovář, Janja Jerebic, Sandi Klavžar

Publication date: 30 July 2007

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (7)

The rectangle covering number of random Boolean matrices ⋮ Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract) ⋮ Strict group testing and the set basis problem ⋮ Biclique cover and local clique cover of graphs ⋮ On biclique coverings ⋮ A set coverage problem ⋮ The biclique covering number of grids

This page was built for publication: Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem