Advanced search
Publication Cover
Journal of Discrete Mathematical Sciences and Cryptography Volume 25, 2022 - Issue 8
Journal homepage
13
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Constructing featured supereulerian graph

Mansour J. AlgefariDepartment of Management and Humanities Sciences, Community College, Qassim University, Buraydah, Saudi [email protected]Correspondence[email protected]
Pages 2729-2738 | Received 01 May 2021, Published online: 20 Dec 2022

References

  • M. J. Algefari and H.-J. Lai, Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree, Graphs and Combinatorics, 37 (2021) 55-64. doi: 10.1007/s00373-020-02229-x
  • M. An and L. Xiong, Supereulerian graphs, collapsible graphs and matchings, Acta Mathematicae Applicatae Sinia, 36(6) (2016) 871-877.
  • J. Bang-Jensen and A. Maddaloni, Sufficient conditions for a digraph to be supereulerian, J. Graph Theory, 79(1) (2015) 8-20. doi: 10.1002/jgt.21810
  • F. T. Boesch, C. Suffel, and R. Tindell, The spanning subgraphs of eulerian graphs, J. Graph Theory, 1, (1977) 79-84. doi: 10.1002/jgt.3190010115
  • J. A. Bondy and U. S. R. Murty, Graph Theory. Springer, New York, 2008.
  • P. A. Catlin, Supereulerian graphs: a survey, J. of Graph Theory, 16, (1992) 177-196. doi: 10.1002/jgt.3190160209
  • Z. H. Chen, H.-J. Lai, Reduction techniques for super-Eulerian graphs and related topics-a survey, Combinatorics and graph theory‘ 95, Vol. 1 (Hefei), World Sci. Publishing, River Edge, NJ 1995 pp. 53-69.
  • V. Chvátal and P. Erdös, A note on Hamiltonian circuits. Discrete Math., 2, (1972) 111-113. doi: 10.1016/0012-365X(72)90079-9
  • L. Han, H.-J. Lai, L. Xiong and H. Yan, The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index, Discrete Math, 310, (2010) 2082-2090. doi: 10.1016/j.disc.2010.03.020
  • H.-J. Lai, Y. Shao and H. Yan, An Update on Supereulerian Graphs, WSEAS Transactions on Mathematics 12, (2013) 926-940.
  • H.-J. Lai and H. Y. Yan, Supereulerian graphs and matchings, Applied Math. Letters, 24 (2011) 1867-1869. doi: 10.1016/j.aml.2011.05.008
  • W. R. Pulleyblank, A note on graphs spanned by Eulerian graphs, J. Graph Theory, 3, (1979) 309-310. doi: 10.1002/jgt.3190030316
  • R. Tian and L. Xiong, The Chvátal-Erdös condition for a graph to have a spanning trail, Graphs and Combinatorics, 31 (2015) 1739-1754. doi: 10.1007/s00373-014-1484-3
  • Travis Baumbaugh and Felice Manganiello, Matroidal root structure of skew polynomials over finite fields, Journal of Discrete Mathematical Sciences and Cryptography, 22:3, (2019) 377-389, DOI: 10.1080/09720529.2019.1600845.
  • J. Xu, P. Li, Z. Miao, K. Wang and H.-J. Lai, Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs, International Journal of Computer Mathematics, 91 (2014), 1662-1672. doi: 10.1080/00207160.2013.858808

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.