B-coloring

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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

A b-coloring of a graph G by k colors is a proper vertex coloring such that in each color class, there exists a vertex adjacent…

2016

Given a proper coloring $f$ of a graph $G$, a b-vertex in $f$ is a vertex that is adjacent to every color class but its own. It…

2014

A proper coloring f is a b-coloring of the vertices of graph G such that in each color class there exists a vertex that has…

2013

Let G be a graph in which each vertex v has a positive integer weight b(v) and each edge (v,w) has a nonnegative integer weight b…

2012

1. b-colorings and b-continuity are graph theoretical concepts. In 1999, Irving and Manlove introduced the concept of b-colorings…

2011

2008

A b-coloring of a graph G is a proper coloring of the nodes of G such that each color class contains a node that has a neighbor…

2008

Automatic web services composition has drawn a great deal of attention recently. Indeed, a large number of composition methods…

2007

Clustering algorithms consist in automatically discovering structure of large data set or providing coherent groups of objects…

2007

Clustering can be considered as the most important unsupervised learning problem which deals with finding a structure in a…