defective coloring (Q5251120)

From Wikidata
Jump to navigation Jump to search
vertex coloring such that every color class induces a subgraph whose maximum degree is bounded by a given constant
  • d-defective coloring
  • (k, d)-coloring
  • d-improper coloring
  • defective colouring
  • relaxed coloring
edit
Language Label Description Also known as
English
defective coloring
vertex coloring such that every color class induces a subgraph whose maximum degree is bounded by a given constant
  • d-defective coloring
  • (k, d)-coloring
  • d-improper coloring
  • defective colouring
  • relaxed coloring

Statements

Identifiers

0 references
 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit