defective coloring
(Q5251120)
vertex coloring such that every color class induces a subgraph whose maximum degree is bounded by a given constant
vertex coloring such that every color class induces a subgraph whose maximum degree is bounded by a given constant
Language:
Current Data About
defective coloring
other details
| aliases |
d-defective coloring (k, d)-coloring d-improper coloring defective colouring relaxed coloring |
| description | vertex coloring such that every color class induces a subgraph whose maximum degree is bounded by a given constant |
External Links
| (P646) |
/m/0czd3wx
|