About: Theorems in graph theory

An Entity of Type: Concept, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Property	Value
dbo:wikiPageID	34604141 (xsd:integer)
dbo:wikiPageRevisionID	546295682 (xsd:integer)
rdf:type	skos:Concept
rdfs:label	Theorems in graph theory (en)
skos:broader	dbc:Theorems_in_discrete_mathematics dbc:Graph_theory
skos:prefLabel	Theorems in graph theory (en)
prov:wasDerivedFrom	wikipedia-en:Category:Theorems_in_graph_theory?oldid=546295682&ns=14
is dbo:wikiPageWikiLink of	dbr:Menger's_theorem dbr:Petersen's_theorem dbr:Vizing's_theorem dbr:De_Bruijn–Erdős_theorem_(graph_theory) dbr:Kuratowski's_theorem dbr:Kőnig's_theorem_(graph_theory) dbr:Robertson–Seymour_theorem dbr:Max-flow_min-cut_theorem dbr:Geiringer–Laman_theorem dbr:Graph_structure_theorem dbr:Erdős–Gallai_theorem dbr:Erdős–Pósa_theorem dbr:Erdős–Stone_theorem dbr:Frucht's_theorem dbr:Fulkerson–Chen–Anstee_theorem dbr:Hall's_marriage_theorem dbr:Kotzig's_theorem dbr:Planar_separator_theorem dbr:Steinitz's_theorem dbr:Cederbaum's_maximum_flow_theorem dbr:Tutte_theorem dbr:Fáry's_theorem dbr:Gale–Ryser_theorem dbr:Gallai–Hasse–Roy–Vitaver_theorem dbr:Heawood_conjecture dbr:Alspach's_conjecture dbr:Balinski's_theorem dbr:Brooks'_theorem dbr:Four_color_theorem dbr:2-factor_theorem dbr:Grötzsch's_theorem dbr:Hall-type_theorems_for_hypergraphs dbr:BEST_theorem dbr:Burr–Erdős_conjecture dbr:Circle_packing_theorem dbr:Grinberg's_theorem dbr:Ore's_theorem dbr:Ramsey's_theorem dbr:Kirchhoff's_theorem dbr:Strong_perfect_graph_theorem dbr:Turán's_theorem dbr:Even_circuit_theorem dbr:Five_color_theorem dbr:Fleischner's_theorem dbr:Schnyder's_theorem dbr:Sims_conjecture dbr:Perfect_graph_theorem dbr:Robbins'_theorem dbr:Symmetric_hypergraph_theorem dbr:Wagner's_theorem dbr:Veblen's_theorem dbr:Road_coloring_theorem
is dcterms:subject of	dbr:Menger's_theorem dbr:Petersen's_theorem dbr:Vizing's_theorem dbr:De_Bruijn–Erdős_theorem_(graph_theory) dbr:Kuratowski's_theorem dbr:Kőnig's_theorem_(graph_theory) dbr:Robertson–Seymour_theorem dbr:Max-flow_min-cut_theorem dbr:Geiringer–Laman_theorem dbr:Graph_structure_theorem dbr:Erdős–Gallai_theorem dbr:Erdős–Pósa_theorem dbr:Erdős–Stone_theorem dbr:Frucht's_theorem dbr:Fulkerson–Chen–Anstee_theorem dbr:Hall's_marriage_theorem dbr:Kotzig's_theorem dbr:Planar_separator_theorem dbr:Steinitz's_theorem dbr:Cederbaum's_maximum_flow_theorem dbr:Tutte_theorem dbr:Fáry's_theorem dbr:Gale–Ryser_theorem dbr:Gallai–Hasse–Roy–Vitaver_theorem dbr:Heawood_conjecture dbr:Alspach's_conjecture dbr:Balinski's_theorem dbr:Brooks'_theorem dbr:Four_color_theorem dbr:2-factor_theorem dbr:Grötzsch's_theorem dbr:Hall-type_theorems_for_hypergraphs dbr:BEST_theorem dbr:Burr–Erdős_conjecture dbr:Circle_packing_theorem dbr:Grinberg's_theorem dbr:Ore's_theorem dbr:Ramsey's_theorem dbr:Kirchhoff's_theorem dbr:Strong_perfect_graph_theorem dbr:Turán's_theorem dbr:Even_circuit_theorem dbr:Five_color_theorem dbr:Fleischner's_theorem dbr:Schnyder's_theorem dbr:Sims_conjecture dbr:Perfect_graph_theorem dbr:Robbins'_theorem dbr:Symmetric_hypergraph_theorem dbr:Wagner's_theorem dbr:Veblen's_theorem dbr:Road_coloring_theorem
is skos:broader of	dbc:Lemmas_in_graph_theory