103 research outputs found
Algorithms for square-3PC(·, ·)-free Berge graphs
We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths
induce a hole, and at least two of the paths are of length 2. This class generalizes clawfree Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of
complexity O(n7) to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class
A polynomial Turing-kernel for weighted independent set in bull-free graphs
The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size k, when k is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size k. A polynomial kernel is unlikely to exist for this problem. We show however that our problem has a polynomial size Turingkernel. More precisely, the hard cases are instances of size O(k5). As a byproduct, if we forbid odd holes in addition to the bull, we show the existence of a polynomial time algorithm for the stable set problem. We also prove that the chromatic number of a bull-free graph is bounded by a function of its clique number and the maximum chromatic number of its triangle-free induced subgraphs. All our results rely on a decomposition theorem for bull-free graphs due to Chudnovsky which is modified here, allowing us to provide extreme decompositions, adapted to our computational purpose
On rank-width of even-hole-free graphs
We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because chordal graphs are even-hole-free. A. A. da Silva, A. Silva and C. Linhares-Sales (2010) showed that planar even-hole-free graphs have bounded rank-width, and N. K. Le (2016) showed that even-hole-free graphs with no star cutset have bounded rank width. A natural question is to ask, whether even-hole-free graphs with no clique cutsets have bounded rank-width. Our result gives a negative answer. Hence we cannot apply the meta-theorem by Courcelle, Makowsky and Rotics, which would provide efficient algorithms for a large number of problems, including the maximum independent set problem, whose complexity remains open for (diamond, even hole)-free graphs
The (theta, wheel)-free graphs Part II: Structure theorem
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this paper we obtain a decomposition theorem for the class of graphs that do not contain an induced subgraph isomorphic to a theta or a wheel, i.e. the class of (theta, wheel)-free graphs. The decomposition theorem uses clique cutsets and 2-joins. Clique cutsets are vertex cutsets that work really well in decomposition based algorithms, but are unfortunately not general enough to decompose more complex hereditary graph classes. A 2-join is an edge cutset that appeared in decomposition theorems of several complex classes, such as perfect graphs, even-hole-free graphs and others. In these decomposition theorems 2-joins are used together with vertex cutsets that are more general than clique cutsets, such as star cutsets and their generalizations (which are much harder to use in algorithms). This is a first example of a decomposition theorem that uses just the combination of clique cutsets and 2-joins. This has several consequences. First, we can easily transform our decomposition theorem into a complete structure theorem for (theta, wheel)-free graphs, i.e. we show how every (theta, wheel)-free graph can be built starting from basic graphs that can be explicitly constructed, and gluing them together by prescribed composition operations; and all graphs built this way are (theta, wheel)-free. Such structure theorems are very rare for hereditary graph classes, only a few examples are known. Secondly, we obtain an (n⁴m)-time decomposition based recognition algorithm for (theta, wheel)-free graphs. Finally, in Parts III and IV of this series, we give further applications of our decomposition theorem
The (theta, wheel)-free graphs Part IV: Induced paths and cycles
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three internally vertex-disjoint paths of length at least 2 between the same pair of distinct vertices. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this series of papers we study the class of graphs that do not contain as an induced subgraph a theta nor a wheel. In Part II of the series we prove a decomposition theorem for this class, that uses clique cutsets and 2-joins. In this paper we use this decomposition theorem to solve several problems related to finding induced paths and cycles in our class
Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković [J. Graph Theory. 84 (2017), no. 3, pp. 233–248]
Stable Sets in {ISK₄,wheel}-Free Graphs
An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K₄ (the complete graph on four vertices). A wheel is a graph that consists of a chordless cycle, together with a vertex that has at least three neighbors in the cycle. A graph is {ISK₄,wheel}-free if it has no ISK₄ and does not contain a wheel as an induced subgraph. We give an O(|V(G)|⁷)-time algorithm to compute the maximum weight of a stable set in an input weighted {ISK₄,wheel}-free graph G with non-negative integer weights
The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs
Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition theorems for hereditary graph classes. In this paper, we prove two structure theorems: one for graphs with no thetas, wheels and prisms as induced subgraphs, and one for graphs with no thetas, wheels and pyramids as induced subgraphs. A consequence is a polynomial time recognition algorithms for these two classes. In Part II of this series we generalize these results to graphs with no thetas and wheels as induced subgraphs, and in Parts III and IV, using the obtained structure, we solve several optimization problems for these graphs
Coloring square-free Berge graphs
We consider the class of Berge graphs that do not contain an induced cycle of length four. We present a purely graph-theoretical algorithm that produces an optimal coloring in polynomial time for every graph in that class
Solar cycle variations of the Cluster spacecraft potential and its use for electron density estimations
International audience[1] A sunlit conductive spacecraft, immersed in tenuous plasma, will attain a positive potential relative to the ambient plasma. This potential is primarily governed by solar irradiation, which causes escape of photoelectrons from the surface of the spacecraft, and the electrons in the ambient plasma providing the return current. In this paper we combine potential measurements from the Cluster satellites with measurements of extreme ultraviolet radiation from the TIMED satellite to establish a relation between solar radiation and spacecraft charging from solar maximum to solar minimum. We then use this relation to derive an improved method for determination of the current balance of the spacecraft. By calibration with other instruments we thereafter derive the plasma density. The results show that this method can provide information about plasma densities in the polar cap and magnetotail lobe regions where other measurements have limitations
- …