1395 search results - page 43 / 279 » (k, )-Distance-Hereditary Graphs |
DM
2008
13 years 9 months ago
2008
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
JGT
2008
13 years 9 months ago
2008
Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and K
GC
2002
Springer
13 years 9 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
JCT
2010
13 years 8 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...