12 search results - page 1 / 3 » The clique operator on circular-arc graphs |
WG
2007
Springer
13 years 11 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
IPL
2007
13 years 4 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
DAM
2010
13 years 5 months ago
2010
DM
2008
13 years 5 months ago
2008
WG
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...