On the CNF-complexity of bipartite graphs containing no K2,2's | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/corr/abs-1206-6068>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Nets_Hawk_Katz>
foaf:homepage	<http://arxiv.org/abs/1206.6068>
dc:identifier	DBLP journals/corr/abs-1206-6068 (xsd:string)
dcterms:issued	2012 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/corr>
rdfs:label	On the CNF-complexity of bipartite graphs containing no K2,2's (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Nets_Hawk_Katz>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/corr/abs-1206-6068/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/corr/abs-1206-6068>
rdfs:seeAlso	<http://arxiv.org/abs/1206.6068>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/corr/corr1206.html#abs-1206-6068>
dc:title	On the CNF-complexity of bipartite graphs containing no K2,2's (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	abs/1206.6068 (xsd:string)