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...
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...
: 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...
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...
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...