gptkbp:instance_of
|
gptkb:theorem
|
gptkbp:applies_to
|
graph theory
|
gptkbp:can_be_used_to_prove
|
the four color theorem
|
gptkbp:criteria
|
planarity of graphs
graph planarity
|
gptkbp:describes
|
characterization of planar graphs
|
gptkbp:has_expansion
|
other types of graphs
|
gptkbp:has_implications_for
|
network design
|
https://www.w3.org/2000/01/rdf-schema#label
|
Kuratowski's theorem
|
gptkbp:is_a_basis_for
|
graph drawing algorithms
|
gptkbp:is_a_foundation_for
|
the study of planar graphs
graph theory research
|
gptkbp:is_a_subject_of
|
mathematical research
mathematical proofs
|
gptkbp:is_a_theorem_in
|
gptkb:Mathematics
|
gptkbp:is_analyzed_in
|
graph structures
|
gptkbp:is_applicable_to
|
network flow problems
|
gptkbp:is_associated_with
|
subdivision of graphs
|
gptkbp:is_connected_to
|
gptkb:Euler's_formula
|
gptkbp:is_discussed_in
|
graph theory textbooks
|
gptkbp:is_essential_for
|
gptkb:Graphics_Processing_Unit
|
gptkbp:is_fundamental_to
|
graph drawing
|
gptkbp:is_often_referenced_in
|
academic papers
|
gptkbp:is_often_used_in
|
gptkb:computer_science
|
gptkbp:is_part_of
|
graph theory curriculum
|
gptkbp:is_related_to
|
topological graph theory
planarity testing
|
gptkbp:is_relevant_to
|
circuit design
|
gptkbp:is_significant_for
|
graph theory
the study of planar embeddings
|
gptkbp:is_taught_in
|
discrete mathematics courses
|
gptkbp:is_used_in
|
gptkb:topology
algorithm design
|
gptkbp:is_utilized_in
|
geographic information systems
|
gptkbp:key
|
graph theory
|
gptkbp:key_concept
|
graph algorithms
|
gptkbp:legal_principle
|
provides a method for testing planarity
|
gptkbp:named_after
|
gptkb:Kazimierz_Kuratowski
|
gptkbp:published_by
|
gptkb:1930
|
gptkbp:state
|
a graph is planar if and only if it does not contain a subgraph that is a subdivision of K5 or K3,3
|
gptkbp:was_a_result_of
|
combinatorial topology
Kazimierz Kuratowski's work
|
gptkbp:bfsParent
|
gptkb:Kazimierz_Kuratowski
gptkb:Steinhaus–_Borsuk–_Lebesgue–_Kuratowski–_Zorn_theorem
|
gptkbp:bfsLayer
|
7
|