384 search results - page 2 / 77 » On s-hamiltonian-connected line graphs |
TKDE
2012
11 years 8 months ago
2012
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
MSR
2006
ACM
14 years 6 days ago
2006
ACM
Files, classes, or methods have frequently been investigated in recent research on co-change. In this paper, we present a first study at the level of lines. To identify line chan...
DM
2008
13 years 6 months ago
2008
The line index of a graph G is the smallest k such that the kth iterated line graph of G is nonplanar. We show that the line index of a graph is either in nite or it is at most 4....
COMBINATORICS
1999
13 years 6 months ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
DAM
2011
13 years 1 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...