Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Grötzsch's_theorem> ?p ?o. }
Showing items 1 to 16 of
16
with 100 items per page.
- Grötzsch's_theorem abstract "In the mathematical field of graph theory, Grötzsch's theorem is the statement that every triangle-free planar graph can be colored with only three colors. According to the four-color theorem, every graph that can be drawn in the plane without edge crossings can have its vertices colored using at most four different colors, so that the two endpoints of every edge have different colors, but according to Grötzsch's theorem only three colors are needed for planar graphs that do not contain three mutually-adjacent vertices.".
- Grötzsch's_theorem thumbnail Bidiakis_cube_3COL.svg?width=300.
- Grötzsch's_theorem wikiPageID "24917736".
- Grötzsch's_theorem wikiPageRevisionID "539592589".
- Grötzsch's_theorem subject Category:Graph_coloring.
- Grötzsch's_theorem subject Category:Planar_graphs.
- Grötzsch's_theorem subject Category:Theorems_in_graph_theory.
- Grötzsch's_theorem comment "In the mathematical field of graph theory, Grötzsch's theorem is the statement that every triangle-free planar graph can be colored with only three colors.".
- Grötzsch's_theorem label "Grötzsch's theorem".
- Grötzsch's_theorem label "Satz von Grötzsch (Graphentheorie)".
- Grötzsch's_theorem sameAs Gr%C3%B6tzsch's_theorem.
- Grötzsch's_theorem sameAs Satz_von_Grötzsch_(Graphentheorie).
- Grötzsch's_theorem sameAs Q5612871.
- Grötzsch's_theorem sameAs Q5612871.
- Grötzsch's_theorem wasDerivedFrom Grötzsch's_theorem?oldid=539592589.
- Grötzsch's_theorem depiction Bidiakis_cube_3COL.svg.