On tours that contain all edges of a hypergraph.
Clique packings and clique partitions of graphs without odd chordless cycles
In this paper we consider partitions (resp. packings) of graphs without odd chordless cycles into cliques of order at least 2. We give a structure theorem, min-max results and characterization theorems for this kind of partitions and packings.
Factors of claw-free graphs
Decomposition of multigraphs
In this note, we consider the problem of existence of an edge-decomposition of a multigraph into isomorphic copies of 2-edge paths . We find necessary and sufficient conditions for such a decomposition of a multigraph H to exist when (i) either H does not have incident multiple edges or (ii) multiplicities of the edges in H are not greater than two. In particular, we answer a problem stated by Z. Skupień.
Page 1