Finding good 2-partitions of digraphs I. Hereditary properties
Texte intégral
Figure
Documents relatifs
Exploring Health-related Uses of Mobile Phones: An Egyptian Case Study, Public Health & Policy (p. London: London School of Hygiene and Tropical Medicine. “Introduction to
These results are asymptotic in the sense that we have assumed that the first-order incoming and reflected wave systems are little modified by the energy transfer. In the
Somewhat surprisingly, we prove that the problem of computing the cutwidth of a semi-complete digraph admits a quadratic Turing kernel, which is encapsulated in the following
The high acidity of Meldrum’s acid, barbituric and tetronic acids in comparison to their acyclic analogues was explained by density functional theory and calculations and by
L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des
We also study the oriented eternal domination and oriented m-eternal domination problems on various graph classes, such as trees, complete graphs, complete bipartite graphs,
An m-(arc-)colored digraph D has a k-colored kernel if there exists a subset K of its vertices such that for every vertex v / ∈ K there exists an at most k-colored directed path from
[r]