ArticleOriginal scientific text
Title
Decompositions of multigraphs into parts with two edges
Authors 1, 2, 2
Affiliations
- Department of Geometry and Algebra, Šafárik University, Jesenná 5, 041 54 Košice, Slovakia
- Faculty of Applied Mathematics AGH, University of Mining and Metallurgy, al. Mickiewicza 30, 30-059 Krakó, Poland
Abstract
Given a family of multigraphs without isolated vertices, a multigraph M is called -decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of . We present necessary and sufficient conditions for the existence of such decompositions if comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.
Keywords
edge decomposition, multigraph, line graph, 1-factor
Bibliography
- K. Bryś, M. Kouider, Z. Lonc and M. Mahéo, Decomposition of multigraphs, Discuss. Math. Graph Theory 18 (1998) 225-232, doi: 10.7151/dmgt.1078.
- Y. Caro, The decomposition of graphs into graphs having two edges, a manuscript.
- Y. Caro and J. Schönheim, Decompositions of trees into isomorphic subtrees, Ars Comb. 9 (1980) 119-130.
- J. Ivančo, M. Meszka and Z. Skupień; Decomposition of multigraphs into isomorphic graphs with two edges, Ars Comb. 51 (1999) 105-112.
- E.B. Yavorski, Representations of oriented graphs and φ-transformations [Russian], in: A. N. Sarkovski, ed., Theoretical and Applied Problems of Differential Equations and Algebra [Russian] (Nauk. Dumka, Kiev, 1978) 247-250.
- M. Las Vergnas, A note on matchings in graphs, Cahiers Centre Etudes Rech. Opér. 17 (1975) 257-260.
- Z. Skupień; Problem 270 [on 2-edge-decomposable multigraphs], Discrete Math. 164 (1997) 320-321.
- D.P. Sumner, Graphs with 1-factors, Proc. Amer. Math. Soc. 42 (1974) 8-12.
Pages:
113-121
Main language of publication
English
Received
2000-10-04
Accepted
2001-05-28
Published
2002
DOI: 10.7151/dmgt.1162
Exact and natural sciences