154 search results - page 16 / 31 » Odd subgraphs and matchings |
110
click to vote
KDD
2007
ACM
16 years 9 days ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
COCOON
2004
Springer
15 years 5 months ago
2004
Springer
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spann...
WG
2000
Springer
15 years 3 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
DM
2007
14 years 12 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
117
click to vote
JCT
2010
14 years 10 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...