Sciweavers

1395 search results - page 207 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
DM
2010
103views more  DM 2010»
14 years 10 months ago
Rainbow paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...
DAM
2006
47views more  DAM 2006»
14 years 10 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
JGT
2008
150views more  JGT 2008»
14 years 9 months ago
Cycle spaces in topological spaces
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
Antoine Vella, R. Bruce Richter
DM
2007
78views more  DM 2007»
14 years 9 months ago
Properties of vertex cover obstructions
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
Michael J. Dinneen, Rongwei Lai
SIAMCOMP
2008
104views more  SIAMCOMP 2008»
14 years 9 months ago
A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
Jochen Könemann, Stefano Leonardi, Guido Sch&...