684 search results - page 54 / 137 » A characterization of b-perfect graphs |
105
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
STOC
1998
ACM
15 years 6 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
139
Voted
CCCG
2009
15 years 3 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
120
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
134
click to vote
IM
2007
15 years 1 months ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...