Sciweavers

1395 search results - page 4 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
JGT
2010
152views more  JGT 2010»
13 years 3 months ago
Cycles of even lengths modulo k
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 ...
Ajit A. Diwan
COMGEO
2011
ACM
13 years 3 months ago
On crossing numbers of geometric proximity graphs
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...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
SWAT
2000
Springer
94views Algorithms» more  SWAT 2000»
13 years 12 months ago
Embeddings of k-Connected Graphs of Pathwidth k
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowsk...
RSA
2011
89views more  RSA 2011»
13 years 3 months ago
Excluding induced subgraphs: Critical graphs
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...
József Balogh, Jane Butterfield
COLOGNETWENTE
2010
13 years 5 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
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...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...