134 search results - page 5 / 27 » Induced Subgraphs of Bounded Degree and Bounded Treewidth |
119
click to vote
GC
2011
Springer
14 years 4 months ago
2011
Springer
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
WG
2005
Springer
15 years 2 months ago
2005
Springer
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. Th...
DAM
2008
14 years 9 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
SIAMDM
2008
14 years 9 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
ARSCOM
2008
14 years 9 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...