3268 search results - page 72 / 654 » The hub number of a graph |
152
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
186
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
180
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
145
click to vote
WG
2004
Springer
15 years 11 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...