نتایج جستجو برای: an eulerian

تعداد نتایج: 5686135  

2016
Orna Kupferman Gal Vardi

Labeled graphs, in which edges are labeled by letters from some alphabet Σ, are extensively used to model many types of relations associated with actions, costs, owners, or other properties. Each path in a labeled graph induces a word in Σ∗ – the one obtained by concatenating the letters along the edges in the path. Classical graph-theory problems give rise to new problems that take these words...

Journal: :Discrete Mathematics 1992
Herbert Fleischner Gert Sabidussi Emanuel Wenger

Fleischner, H., G. Sabidussi and E. Wenger, Transforming eulerian trails, Discrete Mathematics 109 (1992) 103-116. In this paper a set of transformations (K-transformations) between eulerian trails is investigated. It is known that two arbitrary eulerian trails can be transformed into each other by a sequence of K-transformations. For compatible eulerran trails the set of K-transformations is a...

Journal: :Czechoslovak Mathematical Journal 1976

Journal: :Turkish Journal of Computer and Mathematics Education (TURCOMAT) 2021

Journal: :Discrete Mathematics 1992

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید