Sciweavers

30 search results - page 3 / 6
» Contractibility and the Hadwiger Conjecture
Sort
View
RISE
2005
Springer
14 years 4 months ago
Can Aspects Implement Contracts?
Design by ContractTM is commonly cited as an example of the “crosscutting” concerns that aspect-oriented programming can address. We test this conjecture by attempting to imple...
Stephanie Balzer, Patrick Th. Eugster, Bertrand Me...
DM
2008
110views more  DM 2008»
13 years 11 months ago
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
Hajo Broersma, Gasper Fijavz, Tomás Kaiser,...
ICALP
2009
Springer
14 years 11 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
EJC
2008
13 years 11 months ago
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
Jaroslav Nesetril, Patrice Ossona de Mendez
SIAMDM
2010
170views more  SIAMDM 2010»
13 years 5 months ago
Complete Minors and Independence Number
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
Jacob Fox