Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Weak_coloring> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Weak_coloring 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.".
- Weak_coloring thumbnail Weak-2-coloring.svg?width=300.
- Weak_coloring wikiPageID "20505205".
- Weak_coloring wikiPageLength "3661".
- Weak_coloring wikiPageOutDegree "17".
- Weak_coloring wikiPageRevisionID "504652090".
- Weak_coloring wikiPageWikiLink Breadth-first_search.
- Weak_coloring wikiPageWikiLink Category:Distributed_algorithms.
- Weak_coloring wikiPageWikiLink Category:Distributed_computing_problems.
- Weak_coloring wikiPageWikiLink Category:Graph_coloring.
- Weak_coloring wikiPageWikiLink Degree_(graph_theory).
- Weak_coloring wikiPageWikiLink Distributed_algorithm.
- Weak_coloring wikiPageWikiLink Domatic_number.
- Weak_coloring wikiPageWikiLink Dominating_set.
- Weak_coloring wikiPageWikiLink Graph_coloring.
- Weak_coloring wikiPageWikiLink Graph_labeling.
- Weak_coloring wikiPageWikiLink Graph_theory.
- Weak_coloring wikiPageWikiLink Iterated_logarithm.
- Weak_coloring wikiPageWikiLink Vertex_(graph_theory).
- Weak_coloring wikiPageWikiLink File:Weak-2-coloring-construct.svg.
- Weak_coloring wikiPageWikiLink File:Weak-2-coloring.svg.
- Weak_coloring wikiPageWikiLinkText "Weak coloring".
- Weak_coloring wikiPageWikiLinkText "weak 2-coloring".
- Weak_coloring wikiPageWikiLinkText "weak coloring".
- Weak_coloring wikiPageUsesTemplate Template:Log-star.
- Weak_coloring wikiPageUsesTemplate Template:Math.
- Weak_coloring wikiPageUsesTemplate Template:Mvar.
- Weak_coloring wikiPageUsesTemplate Template:Pipe.
- Weak_coloring wikiPageUsesTemplate Template:Reflist.
- Weak_coloring subject Category:Distributed_algorithms.
- Weak_coloring subject Category:Distributed_computing_problems.
- Weak_coloring subject Category:Graph_coloring.
- Weak_coloring hypernym Case.
- Weak_coloring type SupremeCourtOfTheUnitedStatesCase.
- Weak_coloring type Algorithm.
- Weak_coloring 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.".
- Weak_coloring label "Weak coloring".
- Weak_coloring sameAs Q7977939.
- Weak_coloring sameAs m.04zw8zy.
- Weak_coloring sameAs Q7977939.
- Weak_coloring wasDerivedFrom Weak_coloring?oldid=504652090.
- Weak_coloring depiction Weak-2-coloring.svg.
- Weak_coloring isPrimaryTopicOf Weak_coloring.