AbstractA partition graph is an intersection graph for a collection of subsets of auniversal set S with the property that every maximal independent set of vertices corresponds to a partition of S. Two questions which arose in the study of partition graphs are answered by recently discovered examples. An enumeration of the partition graphs on ten or fewer vertices is provided
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potentia...
AbstractA graph G is called a satgraph if there exists a partition A∪B=V(G) such that•A induces a cl...
AbstractA partition graph is an intersection graph for a collection of subsets of auniversal set S w...
AbstractA general partition graph is an intersection graph G on a set S so that for every maximal in...
AbstractWe consider the following generalization of split graphs: A graph is said to be a (k,ℓ)-grap...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
We consider the following generalization of split graphs: A graph is said to be a (k,ℓ)-graph if its...
AbstractThe main topics of this article are split graphs, their degree sequences, and the place of t...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
Given a graph G on n vertices, for which m is it possible to partition the edge set of the m-fold co...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potentia...
AbstractA graph G is called a satgraph if there exists a partition A∪B=V(G) such that•A induces a cl...
AbstractA partition graph is an intersection graph for a collection of subsets of auniversal set S w...
AbstractA general partition graph is an intersection graph G on a set S so that for every maximal in...
AbstractWe consider the following generalization of split graphs: A graph is said to be a (k,ℓ)-grap...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
We consider the following generalization of split graphs: A graph is said to be a (k,ℓ)-graph if its...
AbstractThe main topics of this article are split graphs, their degree sequences, and the place of t...
AbstractSay that graph G is partitionable if there exist integers α⩾2, ω⩾ 2, such that |V(G)| ≡ αω +...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
AbstractIt is shown in this note that it can be recognized in polynomial time whether the vertex set...
Given a graph G on n vertices, for which m is it possible to partition the edge set of the m-fold co...
The partition number θ of a graph G is the minimum number of cliques which cover the points of G. Th...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potentia...
AbstractA graph G is called a satgraph if there exists a partition A∪B=V(G) such that•A induces a cl...