1395 search results - page 47 / 279 » (k, )-Distance-Hereditary Graphs |
233
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
141
click to vote
IPL
2007
15 years 6 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
153
click to vote
WG
2007
Springer
16 years 19 days ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
155
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 4, then G is totally ( + 1)-choosable; that is, if every element (vertex or edge) of G is assigned a list of ...