Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7977939> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q7977939 subject Q7016011.
- Q7977939 subject Q7019756.
- Q7977939 subject Q7464929.
- Q7977939 abstract "In graph theory, a weak coloring is a special case of a graph labeling. A weak k-coloring of a graph G = (V, E) assigns a color c(v) ∈ {1, 2, ..., k} to each vertex v ∈ V, such that each non-isolated vertex is adjacent to at least one vertex with different color. In notation, for each non-isolated v ∈ V, there is a vertex u ∈ U with {u, v} ∈ E and c(u) ≠ c(v).The figure on the right shows a weak 2-coloring of a graph. Each dark vertex (color 1) is adjacent to at least one light vertex (color 2) and vice versa.".
- Q7977939 thumbnail Weak-2-coloring.svg?width=300.
- Q7977939 wikiPageWikiLink Q1304193.
- Q7977939 wikiPageWikiLink Q131476.
- Q7977939 wikiPageWikiLink Q2028293.
- Q7977939 wikiPageWikiLink Q2835898.
- Q7977939 wikiPageWikiLink Q2915204.
- Q7977939 wikiPageWikiLink Q325904.
- Q7977939 wikiPageWikiLink Q3343067.
- Q7977939 wikiPageWikiLink Q383444.
- Q7977939 wikiPageWikiLink Q504843.
- Q7977939 wikiPageWikiLink Q5597093.
- Q7977939 wikiPageWikiLink Q7016011.
- Q7977939 wikiPageWikiLink Q7019756.
- Q7977939 wikiPageWikiLink Q7464929.
- Q7977939 comment "In graph theory, a weak coloring is a special case of a graph labeling. A weak k-coloring of a graph G = (V, E) assigns a color c(v) ∈ {1, 2, ..., k} to each vertex v ∈ V, such that each non-isolated vertex is adjacent to at least one vertex with different color. In notation, for each non-isolated v ∈ V, there is a vertex u ∈ U with {u, v} ∈ E and c(u) ≠ c(v).The figure on the right shows a weak 2-coloring of a graph.".
- Q7977939 label "Weak coloring".
- Q7977939 depiction Weak-2-coloring.svg.