Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2017

2017

A coloring c of a graph $$G=(V,E)$$G=(V,E) is a b-coloring if for every color i there is a vertex, say w(i), of color i whose… Expand

2015

2015

The article presents analysis of the Internet topology graph model. We use usual methods to analyse properties of the model but… Expand

2014

2014

A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We… Expand

2013

2013

The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph… Expand

2009

2009

The wheel graph, denoted by W"n"+"1, is the graph obtained from the circuit C"n with n vertices by adding a new vertex and… Expand

2008

2008

For a fixed pattern graph H , let H -Contractibility denote the problem of deciding whether a given input graph is contractible… Expand

2007

2007

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

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… Expand

1997

1997

Abstract We study a transformation of pseudo-Boolean functions which, when applicable, amounts to constructing from a graph G… Expand

1994

1994

Abstract A family (( S v , T v )∣ v ∈ V ) of ordered pairs of intervals of the real line, each S v containing its corresponding T… Expand