1395 search results - page 4 / 279 » (k, )-Distance-Hereditary Graphs |
125
Voted
JGT
2010
14 years 10 months ago
2010
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
162
click to vote
COMGEO
2011
ACM
14 years 10 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
123
click to vote
RSA
2011
14 years 10 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
150
click to vote
COLOGNETWENTE
2010
15 years 2 days ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...