Add to ORKGIn this thesis, we consider packings and coverings of various complete graphs with the 4-cycle with a pendant edge. We consider both restricted and unrestricted coverings. Necessary and sufficient conditions are given for such structures for (1) complete graphs Kv, (2) complete bipartite graphs Km,n, and (3) complete graphs with a hole K(v,w)
AbstractIn this paper we give necessary and sufficient conditions for the existence of an exact cove...
For a set of graphs, a perfect -packing (-factor) of a graph G is a set of mutually vertex-disjoint ...
Abstract. In this paper, we define an automorphism of a graph packing and of a graph covering. We co...
There are four orientations of cycles on four vertices. Necessary and sufficient conditions are give...
In this paper, we consider decompositions of the complete graph on v vertices into 4-cycles with a p...
In the study of Graph theory, there are eight orientations of the complete graph on three vertices w...
Let K(v,w) denote the complete graph on v vertices with a hole of size w (i.e., K(v, w) = Kv\Kw). We...
In the study of design theory, there are eight orientations of the complete graph on three vertices ...
AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the compl...
A chordless cycle or hole in a graph G is an induced cycle of length at least 4. In the Hole Packing...
The packing and covering problems have been considered for several classes of graphs. For instance, ...
If the complete graph Kn has vertex set X, a minimum covering of K with 4-cycles, (X,C, P), is a par...
Necessary and sufficient conditions are given for the existence of isomorphic decompositions of the ...
We deal with the concept of packings in graphs, which may be regarded as a generalization of the the...
Master of ScienceDepartment of Industrial & Manufacturing Systems EngineeringTodd W. EastonGraph The...
AbstractIn this paper we give necessary and sufficient conditions for the existence of an exact cove...
For a set of graphs, a perfect -packing (-factor) of a graph G is a set of mutually vertex-disjoint ...
Abstract. In this paper, we define an automorphism of a graph packing and of a graph covering. We co...
There are four orientations of cycles on four vertices. Necessary and sufficient conditions are give...
In this paper, we consider decompositions of the complete graph on v vertices into 4-cycles with a p...
In the study of Graph theory, there are eight orientations of the complete graph on three vertices w...
Let K(v,w) denote the complete graph on v vertices with a hole of size w (i.e., K(v, w) = Kv\Kw). We...
In the study of design theory, there are eight orientations of the complete graph on three vertices ...
AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the compl...
A chordless cycle or hole in a graph G is an induced cycle of length at least 4. In the Hole Packing...
The packing and covering problems have been considered for several classes of graphs. For instance, ...
If the complete graph Kn has vertex set X, a minimum covering of K with 4-cycles, (X,C, P), is a par...
Necessary and sufficient conditions are given for the existence of isomorphic decompositions of the ...
We deal with the concept of packings in graphs, which may be regarded as a generalization of the the...
Master of ScienceDepartment of Industrial & Manufacturing Systems EngineeringTodd W. EastonGraph The...
AbstractIn this paper we give necessary and sufficient conditions for the existence of an exact cove...
For a set of graphs, a perfect -packing (-factor) of a graph G is a set of mutually vertex-disjoint ...
Abstract. In this paper, we define an automorphism of a graph packing and of a graph covering. We co...