Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 220,830,739 papers from all fields of science

Search

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

2018

2018

Let G = ( V ( G ), E ( G )) be a path of order n ≥ 1 . Let f m ( G ) be a path with m ≥ 0 independent dominating vertices which…

2016

2016

During the last decade, metric properties of the bags of tree decompositions of graphs have been studied. Roughly, the length and…

2011

2011

A b-coloring of a graph G by k colors is a proper vertex coloring such that every color class contains a color-dominating vertex…

2010

2010

A fall coloring of a graph G is a proper coloring of the vertex set of G such that every vertex of G is a color dominating vertex…

Review

2008

Review

2008

The graph b-coloring is an interesting technique that can be applied to various domains. The proper b-coloring problem is the…

2006

2006

Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a…

2006

2006

Graph coloring is used to characterize some properties of graphs. A b-coloring of a graph G (using colors 1,2,...,k) is a…

2005

2005

An infinite class of counterexamples is given to a conjecture of Dahme et al. [Discuss. Math. Graph Theory, 24 (2004) 423–430…