Dicycle cover of Hamiltonian oriented graphs (Q275871): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spectral Theory and Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3360905 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4387697 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3987039 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3983259 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4028533 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4874607 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraph coverings and edge switchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small cycle cover of 2-connected cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Small cycle covers of 3-connected cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3267901 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Subtournaments of a Tournament / rank | |||
Normal rank |
Latest revision as of 20:31, 11 July 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