Table of Contents
Journal of Discrete Mathematics
Volume 2016, Article ID 7942192, 5 pages
http://dx.doi.org/10.1155/2016/7942192
Research Article

Dicycle Cover of Hamiltonian Oriented Graphs

1Department of Mathematics, College of Science, Qassim University, P.O. Box 6644, Buraydah 51452, Saudi Arabia
2Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA
3College of Mathematics Sciences, Xinjiang Normal University, Urumqi 830054, China

Received 9 October 2015; Accepted 31 December 2015

Academic Editor: Kinkar Ch Das

Copyright © 2016 Khalid A. Alsatami et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. A. Bondy and U. S. R. Murty, Graph Theory, vol. 244 of Graduate Texts in Mathematics, Springer, New York, NY, USA, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  2. J. Bang-Jensen and G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer, 2nd edition, 2010. View at MathSciNet
  3. J. A. Bondy, “Small cycle double covers of graphs,” in Cycles and Rays, pp. 21–40, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1990. View at Google Scholar
  4. Y. X. Luo and R. S. Chen, “Cycle covers of 2-connected 3-regular graphs,” Mathematics and Applications, vol. 9, supplement, pp. 23–25, 1996 (Chinese). View at Google Scholar
  5. H.-J. Lai, “Cycle covers of planar graphs,” Congressus Numerantium, vol. 122, pp. 33–46, 1996. View at Google Scholar
  6. H.-J. Lai and H. Y. Lai, “Cycle covering of plane triangulations,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 10, pp. 3–21, 1991. View at Google Scholar · View at MathSciNet
  7. H.-J. Lai and H. Y. Lai, “Cycle covers in graphs without subdivisions of K4,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 9, pp. 201–207, 1991. View at Google Scholar
  8. H.-J. Lai and H. Y. Lai, “Small cycle covers of planar graphs,” Congressus Numerantium, vol. 85, pp. 203–209, 1991. View at Google Scholar
  9. D. W. Barnette, “Cycle covers of planar 3-connected graphs,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 20, pp. 245–253, 1996. View at Google Scholar · View at MathSciNet
  10. G. Fan, “Subgraph coverings and edge switchings,” Journal of Combinatorial Theory Series B, vol. 84, no. 1, pp. 54–83, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. H.-J. Lai and X. Li, “Small cycle cover of 2-connected cubic graphs,” Discrete Mathematics, vol. 269, no. 1–3, pp. 295–302, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. F. Yang and X. Li, “Small cycle covers of 3-connected cubic graphs,” Discrete Mathematics, vol. 311, no. 2-3, pp. 186–196, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. P. Camion, “Chemins et circuits hamiltoniens des graphes complets,” Comptes Rendus de l'Académie des Sciences, vol. 249, pp. 2151–2152, 1959. View at Google Scholar
  14. J. W. Moon, “On subtournaments of a tournament,” Canadian Mathematical Bulletin, vol. 9, pp. 297–301, 1966. View at Google Scholar · View at MathSciNet