On some graph classes related to perfect graphs: A survey
Texte intégral
Figure
Documents relatifs
We will denote by SEL-COL the optimisation version of the selective graph coloring problem, i.e., the problem which consists in finding for a graph G = (V, E ) the smallest integer
The perfect- ness of line graphs of bipartite graphs is equivalent to K˝onig’s Line Coloring theorem [136], stating that the edge chromatic number (the minimum number of colors
The fractional chromatic number of a graph G can indeed be defined to be the infimum (which actually is a minimum) of the ratios a/b such that, if every vertex of G is replaced by
Since from the definition of fHGC ‡ −1,n there is no σ 1 in the graph as a connected component, with the fixed number of edges, the number of vertices v is bounded, and so is the
Note that Lemma 5.6 and Theorem 5.4 together imply that the problem of finding a (connected) safe set is fixed-parameter tractable when parameterized by vertex cover number..
Graph minors play a central role in parameterized complexity, and the edge contraction operation in turn is essential in the study of graph minors: a graph H is a minor of a graph G
• Watch out when a child’s mouth is closed and he/she hypersalivates and emits fetid breath with a putrid smell, regardless of whether he/she has fever or not. Signs and symptoms
There exists a constant c > 0 such that, for any real number , there are infinitely many integers D for which there exists a tuple of algebraic numbers