On the CNF-complexity of bipartite graphs containing no squares
From MaRDI portal
Publication:1936267
DOI10.1007/s10986-012-9181-5zbMath1258.05113arXiv1206.6068OpenAlexW2963712681MaRDI QIDQ1936267
Publication date: 21 February 2013
Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.6068
Cites Work
This page was built for publication: On the CNF-complexity of bipartite graphs containing no squares