B-coloring
id:
b-coloring-283-12604740
title:
B-coloring
text:
In graph theory, a b-coloring of a graph is a coloring of the vertices where each color class contains a vertex that has a neighbor in all other color classes. The b-chromatic number of a G graph is the largest b(G) positive integer that the G graph has a b-coloring with b(G) number of colors. Victor Campos, Carlos Lima és Ana Silva used the relation between b-coloring and a graph's smallest cycle to partly prove the Erdős–Faber–Lovász conjecture.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/B-coloring
date created:
date modified:
2021-09-05T06:34:54Z
main entity:
{"identifier":"Q23540986","url":"https://www.wikidata.org/entity/Q23540986"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/8/83/Graph_b_coloring_example.svg","width":800,"height":800}
fields total:
13
integrity:
14