57 search results - page 6 / 12 » Edge cover by bipartite subgraphs |
DM
2008
13 years 7 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
EPIA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
CPM
2010
Springer
14 years 5 days ago
2010
Springer
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
COCOON
2004
Springer
14 years 23 days 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...
ENDM
2002
13 years 7 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...