Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Séparateur (théorie des graphes)

Publications associées (25)

Delaunay Graphs of Point Sets in the Plane With Respect to Axis-Parallel Rectangles

János Pach

Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q is an element of P are connected by an edge if and only if there is a rectangle parallel to the coor ...

Wiley-Blackwell2009

Partitioning graphs into complete and empty graphs

Tinaz Ekim

Given integers j and k and a graph G, we consider partitions of the vertex set of G into j + k parts where j of these parts induce empty graphs and the remaining k induce cliques. If such a partition exists, we say G is a (j, k)-graph. For a fixed j and k ...

Elsevier2009

A separator theorem for string graphs and its applications

János Pach

A string graph is the intersection graph of a collection of continuous arcs in the plane. We show that any string graph with in edges can be separated into two parts of roughly equal size by the removal of O(m(3/4)root log m) vertices. This result is then ...

Springer2009

On a graph coloring problem arising from discrete tomography

Dominique de Werra, Bernard Ries

An extension of the basic image reconstruction problem in discrete tomography is considered: given a graph

G=(V,E)

and a family

\mathcal{P}

of chains

P_i

together with vectors

h(P_i)=(h_{i}^{1},...,h_{i}^{k})

, one wants to find a partition $V^{1},. ...

2008

Polar cographs

Dominique de Werra, Tinaz Ekim

Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a partition A, B of its vertex set such that A induces a complete s-partite grap ...

Elsevier2008