@misc {IOPORT.03916306,
    author       = {Hartman, Jehuda},
    title        = {A partitioning property of k-cycled refinements of graphs.},
    howpublished = {Combinatorics, graph theory and computing, Proc. 15th Southeast. Conf., La. State Univ. 1984, Congr. Numerantium 44, 151-154 (1984).},
    year         = {1984},
    abstract     = {[For the entire collection see Zbl 0547.00011.] A graph is k-cycled if all its cycles are integral multiples of an integer $k\ge 2$. In this paper, a partitioning property of refinements of graphs which are k-cycled is established. The partitioning property is applied to obtain bounds on the minimal number of edges of k-cycled refinements. The same property is also used to examine refinements of graphs which are subgraphs of a hypercube.},
    identifier   = {03916306},
}