Repository logo
Article

Open trails in digraphs

Thumbnail Image
DOI: http://dx.doi.org/10.7494/OpMath.2011.31.4.599 

Files

31-4-06.pdf (224.92 KB)

Date

2011

Presentation Date

Editor

Authors

Other contributors

Access rights

Access: otwarty dostęp
Rights: CC BY 4.0
Attribution 4.0 International

Attribution 4.0 International (CC BY 4.0)

Other title

Resource type

artykuł

Version

wersja wydawnicza
thumbnail.journal.alt
Item type:Journal Issue,
Opuscula Mathematica
2011 - Vol. 31 - No. 4

Pagination/Pages:

pp. 599-604

Research Project

Event

Description

Keywords

trail, graph decomposition, bipartite graph

Abstract

It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph $K_{a,b}$, is decomposable into open trails of prescribed even lengths. In this article we consider the corresponding question for directed graphs. We show that the complete directed graphs $\overleftrightarrow{K}n$ and $\overleftrightarrow{K}{a,b}$ are arbitrarily decomposable into directed open trails.

Access rights

Access: otwarty dostęp
Rights: CC BY 4.0
Attribution 4.0 International

Attribution 4.0 International (CC BY 4.0)

URI

https://repo.agh.edu.pl/handle/AGH/50589

Collections

Artykuły (CN-OpMath)