1395 search results - page 42 / 279 » (k, )-Distance-Hereditary Graphs |
COMPGEOM
2006
ACM
14 years 2 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
ARSCOM
2004
13 years 8 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
DM
2000
13 years 8 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
RANDOM
2001
Springer
14 years 28 days ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...