Vertex decomposable graphs, codismantlability, Cohen-Macaulayness and Castelnuovo-Mumford regularity

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is well-covered and it lacks induced cycles of length four, five and seven, than the vertex decomposability, codismantlability and Cohen-Macaulayness for G are all equivalent. The rest deals with the computation of Castelnuovo-Mumford regularity of codismantlable graphs. Note that our approach complements and unifies many of the earlier results on bipartite, chordal and very well-covered graphs

Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so to a better understanding of their true difficulties. More recently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as: Strong Exponential Time Hypothesis (SETH), 3SUM and All-Pairs Shortest-Paths (APSP). According to these assumptions, many graph theoretic problems do not admit truly subquadratic algorithms, nor even truly subcubic algorithms (Williams and Williams, FOCS 2010 and Abboud, Grandoni, Williams, SODA 2015). A central technique used to tackle the difficulty of the above mentioned problems is fixed-parameter algorithms for polynomial-time problems with polynomial dependency in the fixed parameter (P-FPT). This technique was introduced by Abboud, Williams and Wang in SODA 2016 and continued by Husfeldt (IPEC 2016) and Fomin et al. (SODA 2017), using the treewidth as a parameter. Applying this technique to clique-width, another important graph parameter, remained to be done. In this paper we study several graph theoretic problems for which hardness results exist such as cycle problems (triangle detection, triangle counting, girth, diameter), distance problems (diameter, eccentricities, Gromov hyperbolicity, betweenness centrality) and maximum matching. We provide hardness results and fully polynomial FPT algorithms, using clique-width and some of its upper-bounds as parameters (split-width, modular-width and $P\_4$-sparseness). We believe that our most important result is an ${\cal O}(k^4 \cdot n + m)$-time algorithm for computing a maximum matching where $k$ is either the modular-width or the $P\_4$-sparseness. The latter generalizes many algorithms that have been introduced so far for specific subclasses such as cographs, $P\_4$-lite graphs, $P\_4$-extendible graphs and $P\_4$-tidy graphs. Our algorithms are based on preprocessing methods using modular decomposition, split decomposition and primeval decomposition. Thus they can also be generalized to some graph classes with unbounded clique-width

Observations of far-infrared fine structure lines: o III88.35 micrometer and oI 63.2 micrometer

Observations of the O III 88.35 micrometer line and the O I63.2 micrometer were made with a far infrared spectrometer. The sources M17, NGC 7538, and W51 were mapped in the O III line with 1 arc minute resolution and the emission is found to be quite widespread. In all cases the peak of the emission coincides with the maximum radio continuum. The far infrared continuum was mapped simultaneously and in M17, NGC 7538, and W51 the continuum peak is found to be distinct from the center of ionization. The O III line was also detected in W3, W49, and in a number of positions in the Orion nebula. Upper limits were obtained on NGS 7027, NGC 6572, DR21, G29.9-0.0 and M82. The 63.2 micrometer O I line was detected in M17, M42, and marginally in DR21. A partial map of M42 in this line shows that most of the emission observed arises from the Trapezium and from the bright optical bar to the southeast