275 search results - page 6 / 55 » Bounding the Number of Edges in Permutation Graphs |
SWAT
2004
Springer
14 years 21 days ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
DM
2008
13 years 7 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
FOCI
2007
IEEE
14 years 1 months ago
2007
IEEE
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...