[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/dcg/Ackerman09>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Eyal_Ackerman>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs00454-009-9143-9>
foaf:homepage <https://doi.org/10.1007/s00454-009-9143-9>
dc:identifier DBLP journals/dcg/Ackerman09 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs00454-009-9143-9 (xsd:string)
dcterms:issued 2009 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/dcg>
rdfs:label On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Eyal_Ackerman>
swrc:number 3 (xsd:string)
swrc:pages 365-375 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/dcg/Ackerman09/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/dcg/Ackerman09>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/dcg/dcg41.html#Ackerman09>
rdfs:seeAlso <https://doi.org/10.1007/s00454-009-9143-9>
dc:subject Geometric graphs; Topological graphs; Discharging method; Quasi-planar graphs (xsd:string)
dc:title On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 41 (xsd:string)