7 research outputs found
The world of hereditary graph classes viewed through Truemper configurations
In 1982 Truemper gave a theorem that characterizes graphs whose edges can be labeled so that all chordless cycles have prescribed parities. The characterization states that this can be done for a graph G if and only if it can be done for all induced subgraphs of G that are of few speci c types, that we will call Truemper con gurations. Truemper was originally motivated by the problem of obtaining a co-NP characterization of bipartite graphs that are signable to be balanced (i.e. bipartite graphs whose node-node incidence matrices are balanceable matrices). The con gurations that Truemper identi ed in his theorem ended up playing a key role in understanding the structure of several seemingly diverse classes of objects, such as regular matroids, balanceable matrices and perfect graphs. In this survey we view all these classes, and more, through the excluded Truemper con gurations, focusing on the algorithmic consequences, trying to understand what structurally enables e cient recognition and optimization algorithms
Recommended from our members
Forbidden Substructures in Graphs and Trigraphs, and Related Coloring Problems
Given a graph G, χ(G) denotes the chromatic number of G, and ω(G) denotes the clique number of G (i.e. the maximum number of pairwise adjacent vertices in G). A graph G is perfect provided that for every induced subgraph H of G, χ(H) = ω(H). This thesis addresses several problems from the theory of perfect graphs and generalizations of perfect graphs. The bull is a five-vertex graph consisting of a triangle and two vertex-disjoint pendant edges; a graph is said to be bull-free provided that no induced subgraph of it is a bull. The first result of this thesis is a structure theorem for bull-free perfect graphs. This is joint work with Chudnovsky, and it first appeared in [12]. The second result of this thesis is a decomposition theorem for bull-free perfect graphs, which we then use to give a polynomial time combinatorial coloring algorithm for bull-free perfect graphs. We remark that de Figueiredo and Maffray [33] previously solved this same problem, however, the algorithm presented in this thesis is faster than the algorithm from [33]. We note that a decomposition theorem that is very similar (but slightly weaker) than the one from this thesis was originally proven in [52], however, the proof in this thesis is significantly different from the one in [52]. The algorithm from this thesis is very similar to the one from [52]. A class G of graphs is said to be χ-bounded provided that there exists a function f such that for all G in G, and all induced subgraphs H of G, we have that χ(H) ≤ f(ω(H)). χ-bounded classes were introduced by Gyarfas [41] as a generalization of the class of perfect graphs (clearly, the class of perfect graphs is χ-bounded by the identity function). Given a graph H, we denote by Forb*(H) the class of all graphs that do not contain any subdivision of H as an induced subgraph. In [57], Scott proved that Forb*(T) is χ-bounded for every tree T, and he conjectured that Forb*(H) is χ-bounded for every graph H. Recently, a group of authors constructed a counterexample to Scott's conjecture [51]. This raises the following question: for which graphs H is Scott's conjecture true? In this thesis, we present the proof of Scott's conjecture for the cases when H is the paw (i.e. a four-vertex graph consisting of a triangle and a pendant edge), the bull, and a necklace (i.e. a graph obtained from a path by choosing a matching such that no edge of the matching is incident with an endpoint of the path, and for each edge of the matching, adding a vertex adjacent to the ends of this edge). This is joint work with Chudnovsky, Scott, and Trotignon, and it originally appeared in [13]. Finally, we consider several operations (namely, "substitution," "gluing along a clique," and "gluing along a bounded number of vertices"), and we show that the closure of a χ-bounded class under any one of them, as well as under certain combinations of these three operations (in particular, the combination of substitution and gluing along a clique, as well as the combination of gluing along a clique and gluing along a bounded number of vertices) is again χ-bounded. This is joint work with Chudnovsky, Scott, and Trotignon, and it originally appeared in [14]
Structural solutions to maximum independent set and related problems
In this thesis, we study some fundamental problems in algorithmic graph theory. Most
natural problems in this area are hard from a computational point of view. However,
many applications demand that we do solve such problems, even if they are intractable.
There are a number of methods in which we can try to do this:
1) We may use an approximation algorithm if we do not necessarily require the best
possible solution to a problem.
2) Heuristics can be applied and work well enough to be useful for many applications.
3) We can construct randomised algorithms for which the probability of failure is very
small.
4) We may parameterize the problem in some way which limits its complexity.
In other cases, we may also have some information about the structure of the
instances of the problem we are trying to solve. If we are lucky, we may and that we
can exploit this extra structure to find efficient ways to solve our problem. The question
which arises is - How far must we restrict the structure of our graph to be able to solve
our problem efficiently?
In this thesis we study a number of problems, such as Maximum Indepen-
dent Set, Maximum Induced Matching, Stable-II, Efficient Edge Domina-
tion, Vertex Colouring and Dynamic Edge-Choosability. We try to solve problems
on various hereditary classes of graphs and analyse the complexity of the resulting
problem, both from a classical and parameterized point of view
Optimizing Bull-Free Perfect Graphs
. A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomial-time combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bull-free perfect graphs. The algorithms are based on a structural analysis and decomposition of bull-free perfect graphs. Key words. graph algorithms, perfect graphs, analysis of algorithms and problem complexity, combinatorial optimization AMS subject classifications. 05C85, 05C60, 68Q25, 90C27 1 Introduction A graph G is called perfect if the vertices of every induced subgraph H of G can be colored with !(H) colors, where !(H) is the maximum clique size in H. Berge [1] introduced perfect graphs and conjectured the following characterization: A graph is perfect if and only if it contains no odd hole and no odd antihole. Here a hole is a chordless cycle with at least five vertices, and an antihole is the complement of a hole. This conjecture is still open and is known as the ..