The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph

In this article, we consider undirected multiple graphs of any natural multiplicity k > 1. A multiple graph contains edges of three types: ordinary edges, multiple edges, and multiedges. Each edge of the last two types is a union of k linked edges that connect 2 or ( k + 1) vertices, correspondin...

Full description

Bibliographic Details

Published in:	Automatic control and computer sciences Vol. 58; no. 7; pp. 889 - 903
Main Author:	Smirnov, A. V.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.12.2024 Springer Nature B.V
Subjects:	Algorithms Apexes Computer Science Control Structures and Microprogramming Graph theory Graphs Polynomials Eulerian cycle multiple path divisible graph covering trails reachability set multiple graph Eulerian trail graph with quasi-vertices
ISSN:	0146-4116, 1558-108X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!