| http://dbpedia.org/ontology/abstract
|
Crossing Numbers of Graphs is a book in ma … Crossing Numbers of Graphs is a book in mathematics, on the minimum number of edge crossings needed in graph drawings. It was written by Marcus Schaefer, a professor of computer science at DePaul University, and published in 2018 by the CRC Press in their book series Discrete Mathematics and its Applications.Discrete Mathematics and its Applications.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Crossing_Numbers_of_Graphs.jpg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
64029436
|
| http://dbpedia.org/ontology/wikiPageLength
|
4241
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1111032509
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Tur%C3%A1n%27s_brick_factory_problem +
, http://dbpedia.org/resource/File:Crossing_Numbers_of_Graphs.jpg +
, http://dbpedia.org/resource/Crossing_number_%28graph_theory%29 +
, http://dbpedia.org/resource/Graph_skewness +
, http://dbpedia.org/resource/Category:Mathematics_books +
, http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/Bisection_bandwidth +
, http://dbpedia.org/resource/Hypercube_graph +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/CRC_Press +
, http://dbpedia.org/resource/Category:Graph_drawing +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Category:2018_non-fiction_books +
, http://dbpedia.org/resource/Graph_product +
, http://dbpedia.org/resource/L._W._Beineke +
, http://dbpedia.org/resource/Fixed-parameter_tractable +
, http://dbpedia.org/resource/Hanani%E2%80%93Tutte_theorem +
, http://dbpedia.org/resource/String_graph +
, http://dbpedia.org/resource/Complete_graph +
, http://dbpedia.org/resource/Chromatic_number +
, http://dbpedia.org/resource/Category:Geometric_graph_theory +
, http://dbpedia.org/resource/Computational_complexity +
, http://dbpedia.org/resource/1-planar_graph +
, http://dbpedia.org/resource/Complete_bipartite_graph +
, http://dbpedia.org/resource/Book_embedding +
, http://dbpedia.org/resource/F%C3%A1ry%27s_theorem +
, http://dbpedia.org/resource/Graph_drawing +
, http://dbpedia.org/resource/Cycle_graph +
, http://dbpedia.org/resource/Topological_graph_theory +
, http://dbpedia.org/resource/Category:Topological_graph_theory +
, http://dbpedia.org/resource/DePaul_University +
, http://dbpedia.org/resource/Albertson_conjecture +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Category:CRC_Press_books +
, http://dbpedia.org/resource/Crossing_number_inequality +
, http://dbpedia.org/resource/Thickness_%28graph_theory%29 +
, http://dbpedia.org/resource/Thrackle +
, http://dbpedia.org/resource/Planar_graph +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Italic_title +
, http://dbpedia.org/resource/Template:R +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Topological_graph_theory +
, http://dbpedia.org/resource/Category:Geometric_graph_theory +
, http://dbpedia.org/resource/Category:CRC_Press_books +
, http://dbpedia.org/resource/Category:2018_non-fiction_books +
, http://dbpedia.org/resource/Category:Mathematics_books +
, http://dbpedia.org/resource/Category:Graph_drawing +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Crossing_Numbers_of_Graphs?oldid=1111032509&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Crossing_Numbers_of_Graphs.jpg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Crossing_Numbers_of_Graphs +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q96375696 +
, http://dbpedia.org/resource/Crossing_Numbers_of_Graphs +
, https://global.dbpedia.org/id/C9M6N +
|
| rdfs:comment |
Crossing Numbers of Graphs is a book in ma … Crossing Numbers of Graphs is a book in mathematics, on the minimum number of edge crossings needed in graph drawings. It was written by Marcus Schaefer, a professor of computer science at DePaul University, and published in 2018 by the CRC Press in their book series Discrete Mathematics and its Applications.Discrete Mathematics and its Applications.
|
| rdfs:label |
Crossing Numbers of Graphs
|
