By means of a new combinatorial structure – parameter systems – we prove that the class of finite ordered graphs has the partition property with respect to each object
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
AbstractGiven integers j and k and a graph G, we consider partitions of the vertex set of G into j+k...
AbstractBy means of a new combinational structure—parameter systems—we prove that the class of finit...
AbstractAn induced version of the partition theorem for parameter-sets of R. L. Graham and B. L. Rot...
AbstractWe introduce the partition polynomial of a finite set system, which generalizes the matching...
AbstractA canonical (i.e., unrestricted) version of the partition theorem for k-parameter sets of Gr...
AbstractA partial ordering is defined for monotone projections f: N → N, N = {1, 2,…, n}, such that ...
AbstractConsecutive and nested partitions have been extensively studied in the set-partition problem...
AbstractA general graph partitioning problem, which includes graph colouring, homomorphism to H, con...
AbstractThe principal result of this paper provides a nearly complete answer to the following questi...
In this thesis we explore extremal, structural, and algorithmic problems involving the partitioning ...
AbstractA graph G admits a tree-partition of width k if its vertex set can be partitioned into sets ...
AbstractBy the aid of a slight generalization of the Hales-Jewett theorem [Trans. Amer. Math. Soc. 1...
AbstractThose unary algebras (A, ƒ) (A a set, ƒ a mapping from A into A) are characterized for which...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
AbstractGiven integers j and k and a graph G, we consider partitions of the vertex set of G into j+k...
AbstractBy means of a new combinational structure—parameter systems—we prove that the class of finit...
AbstractAn induced version of the partition theorem for parameter-sets of R. L. Graham and B. L. Rot...
AbstractWe introduce the partition polynomial of a finite set system, which generalizes the matching...
AbstractA canonical (i.e., unrestricted) version of the partition theorem for k-parameter sets of Gr...
AbstractA partial ordering is defined for monotone projections f: N → N, N = {1, 2,…, n}, such that ...
AbstractConsecutive and nested partitions have been extensively studied in the set-partition problem...
AbstractA general graph partitioning problem, which includes graph colouring, homomorphism to H, con...
AbstractThe principal result of this paper provides a nearly complete answer to the following questi...
In this thesis we explore extremal, structural, and algorithmic problems involving the partitioning ...
AbstractA graph G admits a tree-partition of width k if its vertex set can be partitioned into sets ...
AbstractBy the aid of a slight generalization of the Hales-Jewett theorem [Trans. Amer. Math. Soc. 1...
AbstractThose unary algebras (A, ƒ) (A a set, ƒ a mapping from A into A) are characterized for which...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
AbstractGiven integers j and k and a graph G, we consider partitions of the vertex set of G into j+k...
DOI
Add to ORKG