245 search results - page 6 / 49 » Group connectivity of graphs with diameter at most 2 |
ORL
2008
13 years 7 months ago
2008
By analogy with the conjecture of Hirsch, we conjecture that the order of the largest total curvature of the central path associated to a polytope is the number of inequalities de...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
Given an edge-weighted undirected graph G with a specified set of terminals, let the density of any subgraph be the ratio of its weight/cost to the number of terminals it contain...
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the del...
ARSCOM
2007
13 years 7 months ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2