<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

Browsing by Author "Billington, EJ"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item type:Item,
    Packing complete multipartite graphs with 4-cycles
    (2001)
    Billington, EJ
    ;
    Fu, HL
    ;
    Rodger, CA
    ;
    應用數學系
    ;
    Department of Applied Mathematics
    In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given. (C) 2001 John Wiley & Sons, Inc.
  • Thumbnail Image
    Item type:Item,
    Packing lambda-fold complete multipartite graphs with 4-cycles
    (2005-06-01)
    Billington, EJ
    ;
    Fu, HL
    ;
    Rodger, CA
    ;
    應用數學系
    ;
    Department of Applied Mathematics
    A maximum packing of any lambda-fold complete multipartite graph (where there are lambda edges between any two vertices in different parts) with edge-disjoint 4- cycles is obtained and the size of each minimum leave is given. Moreover, when lambda =2, maximum 4-cycle packings are found for all possible leaves.