Defective coloring (original) (raw)
In graph theory, a mathematical discipline, coloring refers to an assignment of colours or labels to vertices, edges and faces of a graph. 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. (See here for Glossary of graph theory)
| Property | Value |
|---|---|
| dbo:abstract | In graph theory, a mathematical discipline, coloring refers to an assignment of colours or labels to vertices, edges and faces of a graph. 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. (See here for Glossary of graph theory) (en) Дефектная раскраска — это вариант правильной раскраски вершин. В правильной раскраске вершин вершины раскрашиваются так, что никакая из смежных вершин не имеют одного цвета. При дефектной раскраске, с другой стороны, вершинам разрешено в известной мере иметь соседей того же цвета. (ru) |
| dbo:thumbnail | wiki-commons:Special:FilePath/0,_1,_2.png?width=300 |
| dbo:wikiPageExternalLink | http://dl.acm.org/citation.cfm%3Fid=114315 http://dl.acm.org/citation.cfm%3Fid=314387 |
| dbo:wikiPageID | 28646503 (xsd:integer) |
| dbo:wikiPageLength | 16237 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1105391569 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Independent_set_(graph_theory) dbc:Graph_coloring dbr:Glossary_of_graph_theory dbr:Graph_coloring dbr:Dan_Archdeacon dbr:László_Lovász dbr:Component_(graph_theory) dbr:Outerplanar_graph dbr:Four_color_theorem dbr:Graph_theory dbr:Edge_contraction dbr:File:Example_of_defective_colouring_of...on_five_vertices_when_d_=_0,_1,_2.PNG |
| dbp:wikiPageUsesTemplate | dbt:Citation dbt:Refbegin dbt:Refend dbt:Reflist |
| dcterms:subject | dbc:Graph_coloring |
| rdfs:comment | In graph theory, a mathematical discipline, coloring refers to an assignment of colours or labels to vertices, edges and faces of a graph. 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. (See here for Glossary of graph theory) (en) Дефектная раскраска — это вариант правильной раскраски вершин. В правильной раскраске вершин вершины раскрашиваются так, что никакая из смежных вершин не имеют одного цвета. При дефектной раскраске, с другой стороны, вершинам разрешено в известной мере иметь соседей того же цвета. (ru) |
| rdfs:label | Defective coloring (en) Дефектная раскраска (ru) |
| owl:sameAs | freebase:Defective coloring wikidata:Defective coloring dbpedia-ru:Defective coloring https://global.dbpedia.org/id/4iWKo |
| prov:wasDerivedFrom | wikipedia-en:Defective_coloring?oldid=1105391569&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/0,_1,_2.png |
| foaf:isPrimaryTopicOf | wikipedia-en:Defective_coloring |
| is dbo:wikiPageWikiLink of | dbr:Incidence_coloring dbr:Interval_edge_coloring dbr:Graph_coloring |
| is foaf:primaryTopic of | wikipedia-en:Defective_coloring |
