Critical chromatic number and the complexity of perfect packings in graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Perfect packings with complete graphs minus an edge
European Journal of Combinatorics
Embedding into Bipartite Graphs
SIAM Journal on Discrete Mathematics
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
| Hi-index | 0.00 |
Let G be a graph of order 4k and let δ(G) denote the minimum degree of G. Let F be a given connected graph. Suppose that |V(G)| is a multiple of |V(F)|. A spanning subgraph of G is called an F-factor if its components are all isomorphic to F. In this paper, we prove that if δ(G)≥5-2k, then G contains a K4--factor (K4- is the graph obtained from K4 by deleting just one edge). The condition on the minimum degree is best possible in a sense. In addition, the proof can be made algorithmic. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 111–128, 2002