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.

2016

2016

We study the distributed (Δ + 1)-vertex-coloring and (2Δ − 1)-edge-coloring problems. These problems are among the most important… Expand

Is this relevant?

2015

2015

In the distributed message passing model a communication network is represented by an n-vertex graph G = (V,E) of maximum degree… Expand

Is this relevant?

2002

2002

We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

Abstract In this paper we extend the concept of the regular edge labeling for general plane graphs and for triconnected… Expand

Is this relevant?

1997

1997

A very simple randomised distributed algorithm imposing an acyclic orientation on any arbitrary anonymous asynchronous network is… Expand

Is this relevant?

1995

1995

It is shown that in the random graph Gn p with (fixed) edge probability p > 0, the number of edges that have to be examined in… Expand

Is this relevant?

1994

1994

The Tutte-Grothendieck polynomial T(G; x, y) of a graph G encodes numerous interesting combinatorial quantities associated with… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

Abstract The question whether a polynomial time recognition algorithm for the class of perfectly orderable graphs exists was… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Etude de la determination de la structure combinatoire entiere d'un polytope d-dimensionnel simple P a partir de son graphe G(P… Expand

Is this relevant?

Highly Cited

1973

Highly Cited

1973

Let G be a finite graph with p vertices and @g its chromatic polynomial. A combinatorial interpretation is given to the positive… Expand

Is this relevant?