Dicycle cover of Hamiltonian oriented graphs

DOI10.1155/2016/7942192MaRDI QIDQ275871zbMATH OpenOpenAlexWikidataFDO

Authors Khalid A. Alsatami, Hong-Jian Lai, Xindong Zhang

Publication date 26 April 2016

Published in Journal of Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2016/7942192

zbMATH Keywords

Hamiltonian oriented complete bipartite graphsHamiltonian oriented graphsstrong tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

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.

Recommendations

• scientific article; zbMATH DE number 147647
• On integrality, stability and composition of dicycle packings and covers
• Covering the vertices of a digraph by cycles of prescribed length
• scientific article; zbMATH DE number 4091535
• scientific article; zbMATH DE number 3910427

Cites work

• Digraphs. Theory, algorithms and applications
• Graph theory
• scientific article; zbMATH DE number 3150485 (Why is no real title available?)
• scientific article; zbMATH DE number 4214053 (Why is no real title available?)
• scientific article; zbMATH DE number 26498 (Why is no real title available?)
• scientific article; zbMATH DE number 30747 (Why is no real title available?)
• scientific article; zbMATH DE number 140148 (Why is no real title available?)
• scientific article; zbMATH DE number 1151791 (Why is no real title available?)
• scientific article; zbMATH DE number 871189 (Why is no real title available?)
• On Subtournaments of a Tournament
• Small cycle cover of 2-connected cubic graphs
• Small cycle covers of 3-connected cubic graphs
• Subgraph coverings and edge switchings

Cited in

(1)

• scientific article; zbMATH DE number 147647 (Why is no real title available?)

This page was built for publication: Dicycle cover of Hamiltonian oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q275871)