275 search results - page 13 / 55 » Bounding the Number of Edges in Permutation Graphs |
EJC
2007
13 years 8 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study frequency allocation in wireless networks. A wireless network is modeled by an undirected graph, with vertices corresponding to cells. In each vertex we have a certain nu...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
RANDOM
2001
Springer
14 years 26 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...
DM
2010
13 years 8 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...