Dicycle cover of Hamiltonian oriented graphs (Q275871): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C45 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6573885 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strong tournaments | |||
| Property / zbMATH Keywords: strong tournaments / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Hamiltonian oriented graphs | |||
| Property / zbMATH Keywords: Hamiltonian oriented graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Hamiltonian oriented complete bipartite graphs | |||
| Property / zbMATH Keywords: Hamiltonian oriented complete bipartite graphs / rank | |||
Normal rank | |||
Revision as of 16:30, 27 June 2023
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
