1149 search results - page 36 / 230 » Minimally non-Pfaffian graphs |
DM
2006
14 years 11 months ago
2006
LATIN
2000
Springer
15 years 3 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
DAM
2000
14 years 11 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that all common variations of the game require the same ...