Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Cycle (graph theory)Erdős–Faber–Lovász conjectureGraph (discrete mathematics)Graph theory

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A characterization of edge b-critical graphs
2016
2016
Graphs with large girth are b-continuous
2015
2015
The b-chromatic index of graphs
2013
2013
B-chromatic Index of Graphs
2011
2011
On lower bounds for the b-chromatic number of connected bipartite graphs
2010
2010
Toward Improving Re-coloring Based Clustering with Graph b-Coloring
This paper proposes an approach toward improving re-coloring based clustering with graph b-coloring. Previous b-coloring based… 
2009
2009
Towards B-Coloring of SOM
The Self-Organizing Map (SOM) is one of the most popular neural network methods. It is a powerful tool in visualization and… 
2008
2008
Multicoloring and Mycielski construction
2008
2008
A Graph b-coloring Based Scheme for Composition-Oriented Web Services Abstraction: COWSA
  • Lyes Dekar
  • ICSOC PhD Symposium
  • 2008
  • Corpus ID: 6024406
Automatic web services composition has drawn a great deal of attention recently. Indeed, a large number of composition methods… 
2007
2007
A New Greedy Algorithm for Improving b-Coloring Clustering
This paper proposes a new greedy algorithm to improve the specified b-coloring partition while satisfying b-coloring property… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)