Titlebook: Combinatorial Algorithms; 20th International W Jiří Fiala,Jan Kratochvíl,Mirka Miller Conference proceedings 2009 Springer-Verlag Berlin He

厚颜无耻

Integrality Properties of Certain Special Balanceable Familiesuemper’s characterization of balanceable matrices). In this paper we study a proper subclass of balanceable clutters called quasi-graphical defined by forbidding one-sided even wheels and one-sided even 3-path configurations. We characterize Mengerian quasi-graphical clutters and, as a consequence,

横截,横断

PRO

Polynomial Kernels for 3-Leaf Power Graph Modification Problems in .. The 3-leaf power edge modification problems, . edition (also known as the .3.), completion and edge-deletion are FPT when parameterized by the size of the edge set modification. However, a polynomial kernel was known for none of these three problems. For each of them, we provide a kernel with

Flagging

灰姑娘

Pigeon

Fully Decomposable Split Graphser a given split graph is fully decomposable, i.e., whether it can be partitioned into connected parts of order ..,..,...,.. for every ..,..,...,.. summing up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts

渐变

Feedback Vertex Set on Graphs of Low Cliquewidthnnot check if . vertices meet all cycles by looking only at their neighbors. Dynamic programming algorithms for problems based on non-local properties are usually more complicated. In this paper, given a graph . of cliquewidth . and a .-expression of ., we solve the Minimum Feedback Vertex Set probl

certitude

Note on Decomposition of ,, into (0,,)-prismste graph ... In [2] the first two authors established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph .. into certain families of 3-regular graphs of order 2.. In this paper we tackle the problem of decompositions of .. into 3-regular graphs

capillaries

CRASS