3008 search results - page 47 / 602 » Independence in connected graphs |
122
click to vote
ALENEX
2003
15 years 2 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
100
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
COMBINATORICS
2004
15 years 17 days ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...
APWEB
2008
Springer
15 years 2 months ago
2008
Springer
The study of a national Web graph is challenging and can provide insight into social phenomena specific to a country. However, because there is no country border in the Web, decidi...
135
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...