Defective coloring
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)
Link from a Wikipage to another Wikipage
primaryTopic
Defective coloring
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)
has abstract
In graph theory, a mathematica ...... for Glossary of graph theory)
@en
Дефектная раскраска — это вари ...... е иметь соседей того же цвета.
@ru
Link from a Wikipage to an external page
Wikipage page ID
28,646,503
page length (characters) of wiki page
Wikipage revision ID
993,995,192
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In graph theory, a mathematica ...... for Glossary of graph theory)
@en
Дефектная раскраска — это вари ...... е иметь соседей того же цвета.
@ru
label
Defective coloring
@en
Дефектная раскраска
@ru