Partition properties on countable bipartite graphs
نویسندگان
چکیده
منابع مشابه
Countable locally 2-arc-transitive bipartite graphs
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new families of previously unknown countably infinite locally-2-arc-transitive graphs, each family containing continuum many members. These exampl...
متن کاملOn factorial properties of chordal bipartite graphs
For a graph property X, let Xn be the number of graphs with vertex set {1, . . . , n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and n1 ≤ Xn ≤ n2 for some positive constants c1 and c2. Hereditary properties with the speed slower than factorial are surprisingly well structured. The situation wi...
متن کاملThe Pk Partition Problem and Related Problems in Bipartite Graphs
In this paper, we continue the investigation proposed in [15] about the approximability of Pk partition problems, but focusing here on their complexity. More precisely, we prove that the problem consisting of deciding if a graph of nk vertices has n vertex disjoint simple paths {P1, · · · , Pn} such that each path Pi has k vertices is NP-complete, even in bipartite graphs of maximum degree 3. N...
متن کاملThe Path-partition Problem in Bipartite Distance-hereditary Graphs
A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.
متن کاملThe path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Miskolc Mathematical Notes
سال: 2017
ISSN: 1787-2405,1787-2413
DOI: 10.18514/mmn.2017.809