Covering and Euler cycles on non-oriented graphs
type: Item
instance of: scholarly article
title: Covering and Euler cycles on non-oriented graphs
zbMATH Open document ID: 1413.05170
author: G. A. T. F. da Costa
author: M. Policarpo
published in: Periodica Mathematica Hungarica
publication date: 2019-02-01T00:00:00Z
review text: A cycle is called an edge covering cycle if every edge of the graph G is present at least once in the cycle. The authors prove a formula for counting the number of equivalence classes of nonperiodic covering cycles in the graph. A special case gives the number of Euler cycles in the non-oriented graph. A determinantal identity is established in which the number of Euler cycles can be computed from one of the coefficients in a formal Taylor expansion form of the identity.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7011038
zbMATH Keywords: covering cycles
zbMATH Keywords: Euler cycles
zbMATH Keywords: non-oriented graphs
MaRDI profile type: Publication
full work available at URL: s10998-018-0235-2
OpenAlex ID: W2794239989
DOI: 10.1007/S10998-018-0235-2
description: scientific article; zbMATH DE number 7011038