Dicycle cover of Hamiltonian oriented graphs (Q275871): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59123227, #quickstatements; #temporary_batch_1704602819833 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:53, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dicycle cover of Hamiltonian oriented graphs |
scientific article |
Statements
Dicycle cover of Hamiltonian oriented graphs (English)
0 references
26 April 2016
0 references
Summary: A dicycle cover of a digraph \(D\) is a family \(\mathcal{F}\) of dicycles of \(D\) such that each arc of \(D\) lies in at least one dicycle in \(\mathcal{F}\). We investigate the problem of determining the upper bounds for the minimum number of dicycles which cover all arcs in a strong digraph. Best possible upper bounds of dicycle covers are obtained in a number of classes of digraphs including strong tournaments, Hamiltonian oriented graphs, Hamiltonian oriented complete bipartite graphs, and families of possibly non-Hamiltonian digraphs obtained from these digraphs via a sequence of 2-sum operations.
0 references
strong tournaments
0 references
Hamiltonian oriented graphs
0 references
Hamiltonian oriented complete bipartite graphs
0 references