Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Rainbow_coloring> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Rainbow_coloring abstract "In graph theory, a path in an edge-colored graph is said to be rainbow if no color repeats on it. A graph is said to be rainbow colored if there is a rainbow path between each pair of its vertices. If there is a rainbow shortest path between each pair of vertices, the graph is said to be strong rainbow colored.".
- Rainbow_coloring thumbnail Wheel_rainbow_coloring.svg?width=300.
- Rainbow_coloring wikiPageID "43112064".
- Rainbow_coloring wikiPageLength "6511".
- Rainbow_coloring wikiPageOutDegree "14".
- Rainbow_coloring wikiPageRevisionID "673806210".
- Rainbow_coloring wikiPageWikiLink Category:Graph_coloring.
- Rainbow_coloring wikiPageWikiLink Complete_graph.
- Rainbow_coloring wikiPageWikiLink Cycle_graph.
- Rainbow_coloring wikiPageWikiLink Distance_(graph_theory).
- Rainbow_coloring wikiPageWikiLink Edge_(graph_theory).
- Rainbow_coloring wikiPageWikiLink Edge_coloring.
- Rainbow_coloring wikiPageWikiLink Graph_(mathematics).
- Rainbow_coloring wikiPageWikiLink Graph_theory.
- Rainbow_coloring wikiPageWikiLink NP-complete.
- Rainbow_coloring wikiPageWikiLink NP-completeness.
- Rainbow_coloring wikiPageWikiLink Path_(graph_theory).
- Rainbow_coloring wikiPageWikiLink Rainbow_matching.
- Rainbow_coloring wikiPageWikiLink Tree_(graph_theory).
- Rainbow_coloring wikiPageWikiLink Vertex_(graph_theory).
- Rainbow_coloring wikiPageWikiLink Wheel_graph.
- Rainbow_coloring wikiPageWikiLink File:Wheel_rainbow_coloring.svg.
- Rainbow_coloring wikiPageWikiLinkText "Rainbow coloring".
- Rainbow_coloring wikiPageWikiLinkText "rainbow".
- Rainbow_coloring hasPhotoCollection Rainbow_coloring.
- Rainbow_coloring wikiPageUsesTemplate Template:Citation.
- Rainbow_coloring wikiPageUsesTemplate Template:Reflist.
- Rainbow_coloring wikiPageUsesTemplate Template:Sfnp.
- Rainbow_coloring subject Category:Graph_coloring.
- Rainbow_coloring comment "In graph theory, a path in an edge-colored graph is said to be rainbow if no color repeats on it. A graph is said to be rainbow colored if there is a rainbow path between each pair of its vertices. If there is a rainbow shortest path between each pair of vertices, the graph is said to be strong rainbow colored.".
- Rainbow_coloring label "Rainbow coloring".
- Rainbow_coloring sameAs m.011114w7.
- Rainbow_coloring sameAs Q18393198.
- Rainbow_coloring sameAs Q18393198.
- Rainbow_coloring wasDerivedFrom Rainbow_coloring?oldid=673806210.
- Rainbow_coloring depiction Wheel_rainbow_coloring.svg.
- Rainbow_coloring isPrimaryTopicOf Rainbow_coloring.
