Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Defective_coloring> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Defective_coloring abstract "In graph theory, a mathematical discipline, defective coloring is a variant of proper vertex coloring. In a proper vertex coloring, the vertices are coloured such that no adjacent vertices have the same colour. In defective coloring, on the other hand, vertices are allowed to have neighbours of the same colour to a certain extent. More precisely, a (k, d)-coloring of a graph G is a coloring of its vertices with k colours such that each vertex has at most d neighbours having the same colour. Hence, (k, 0)-coloring is equivalent to proper vertex coloring. In graph theoretic terms, each colour class in a proper vertex coloring forms an independent set, while each colour class in a defective coloring forms a subgraph of degree at most d.".
- Defective_coloring wikiPageID "28646503".
- Defective_coloring wikiPageRevisionID "532066514".
- Defective_coloring hasPhotoCollection Defective_coloring.
- Defective_coloring subject Category:Graph_coloring.
- Defective_coloring comment "In graph theory, a mathematical discipline, defective coloring is a variant of proper vertex coloring. In a proper vertex coloring, the vertices are coloured such that no adjacent vertices have the same colour. In defective coloring, on the other hand, vertices are allowed to have neighbours of the same colour to a certain extent. More precisely, a (k, d)-coloring of a graph G is a coloring of its vertices with k colours such that each vertex has at most d neighbours having the same colour.".
- Defective_coloring label "Defective coloring".
- Defective_coloring sameAs m.0czd3wx.
- Defective_coloring sameAs Q5251120.
- Defective_coloring sameAs Q5251120.
- Defective_coloring wasDerivedFrom Defective_coloring?oldid=532066514.
- Defective_coloring isPrimaryTopicOf Defective_coloring.