Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Road_coloring_problem> ?p ?o. }
Showing items 1 to 49 of
49
with 100 items per page.
- Road_coloring_problem abstract "In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from any other point within a network (which might be a representation of city streets or a maze). In the real world, this phenomenon would be as if you called a friend to ask for directions to his house, and he gave you a set of directions that worked no matter where you started from. This theorem also has implications in symbolic dynamics.The theorem was first conjectured by Roy Adler and Benjamin Weiss (1970). It was proved by Avraham Trahtman (2009).".
- Road_coloring_problem thumbnail Road_coloring_conjecture.svg?width=300.
- Road_coloring_problem wikiPageExternalLink dmAE0155.pdf.
- Road_coloring_problem wikiPageID "7166633".
- Road_coloring_problem wikiPageRevisionID "583095152".
- Road_coloring_problem author1Link "Roy Adler".
- Road_coloring_problem author2Link "Benjamin Weiss".
- Road_coloring_problem authorlink "Avraham Trahtman".
- Road_coloring_problem first "Avraham".
- Road_coloring_problem first "Benjamin".
- Road_coloring_problem first "Roy".
- Road_coloring_problem hasPhotoCollection Road_coloring_problem.
- Road_coloring_problem last "Adler".
- Road_coloring_problem last "Trahtman".
- Road_coloring_problem last "Weiss".
- Road_coloring_problem year "1970".
- Road_coloring_problem year "2009".
- Road_coloring_problem subject Category:Automata_theory.
- Road_coloring_problem subject Category:Combinatorics.
- Road_coloring_problem subject Category:Conjectures.
- Road_coloring_problem subject Category:Graph_coloring.
- Road_coloring_problem subject Category:Mathematics_and_culture.
- Road_coloring_problem subject Category:Theorems_in_graph_theory.
- Road_coloring_problem subject Category:Topological_graph_theory.
- Road_coloring_problem type Abstraction100002137.
- Road_coloring_problem type Cognition100023271.
- Road_coloring_problem type Communication100033020.
- Road_coloring_problem type Concept105835747.
- Road_coloring_problem type Conjectures.
- Road_coloring_problem type Content105809192.
- Road_coloring_problem type Hypothesis105888929.
- Road_coloring_problem type Idea105833840.
- Road_coloring_problem type Message106598915.
- Road_coloring_problem type Proposition106750804.
- Road_coloring_problem type PsychologicalFeature100023100.
- Road_coloring_problem type Speculation105891783.
- Road_coloring_problem type Statement106722453.
- Road_coloring_problem type Theorem106752293.
- Road_coloring_problem type TheoremsInDiscreteMathematics.
- Road_coloring_problem comment "In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from any other point within a network (which might be a representation of city streets or a maze).".
- Road_coloring_problem label "Road coloring problem".
- Road_coloring_problem label "Теорема о раскраске дорог".
- Road_coloring_problem sameAs m.0h7r36.
- Road_coloring_problem sameAs Q1937896.
- Road_coloring_problem sameAs Q1937896.
- Road_coloring_problem sameAs Road_coloring_problem.
- Road_coloring_problem wasDerivedFrom Road_coloring_problem?oldid=583095152.
- Road_coloring_problem depiction Road_coloring_conjecture.svg.
- Road_coloring_problem isPrimaryTopicOf Road_coloring_problem.