Vertex degree sums for supereulerian bipartite digraphs. (English) Zbl 07879850
Summary: A digraph is considered supereulerian if it possesses a spanning closed ditrail. Let \(n\) be positive integer and \(D_{n,n}\) be a bipartite digraph, whose vertices are divided into two equal parts of size \(n\). If \(D_{n,n}\) is strongly connected and \(\delta^- + \delta^+ \geq n+1\), where \(\delta^-\) is its minimum in-degree and \(\delta^+\) is its minimum out-degree, then \(D_{n,n}\) is supereulerian digraph.
References:
| [1] | Algefari, M. J.; Lai, H.-J., Supereulerian digraphs with large arc-strong connectivity, J. Graph Theory, 81, 393-402, 2016 · Zbl 1333.05132 |
| [2] | Algefari, M. J.; Lai, H.-J.; Liu, J.; Zhang, X., Supereulerian digraphs with forbidden induced subdigraphs containing short dipaths, Ars Comb., 147, 289-301, 2019 · Zbl 1488.05218 |
| [3] | Bang-Jensen, J.; Gutin, G. Z., Digraphs: Theory, Algorithms and Applications, 2008, Springer Science & Business Media |
| [4] | Bang-Jensen, J.; Maddaloni, A., Sufficient conditions for a digraph to be supereulerian, J. Graph Theory, 79, 8-20, 2015 · Zbl 1312.05060 |
| [5] | Boesch, F. T.; Suffel, C.; Tindell, R., The spanning subgraphs of Eulerian graphs, J. Graph Theory, 1, 79-84, 1977 · Zbl 0363.05042 |
| [6] | Camion, P., Chemins et circuits hamiltoniens des graphes complets, C. R. Hebd. Séances Acad. Sci., 249, 2151-2152, 1959 · Zbl 0092.15801 |
| [7] | Catlin, P. A., Supereulerian graphs: a survey, J. Graph Theory, 16, 177-196, 1992 · Zbl 0771.05059 |
| [8] | Dong, C.; Meng, J.; Liu, J., Sufficient ore type condition for a digraph to be supereulerian, Appl. Math. Comput., 410, Article 126470 pp., 2021 · Zbl 1510.05162 |
| [9] | Hong, Y.; Lai, H.-J.; Liu, Q., Supereulerian digraphs, Discrete Math., 330, 87-95, 2014 · Zbl 1295.05116 |
| [10] | Huo, B.; Du, Q.; Li, P.; Wu, Y.; Yin, J.; Lai, H.-J., Supereulerian regular matroids without small cocircuits, J. Graph Theory, 102, 107-127, 2023 · Zbl 1540.05031 |
| [11] | Lai, H.-J., Contractions and Hamiltonian line graphs, J. Graph Theory, 12, 11-15, 1988 · Zbl 0655.05046 |
| [12] | Pulleyblank, W. R., A note on graphs spanned by Eulerian graphs, J. Graph Theory, 3, 309-310, 1979 · Zbl 0414.05040 |
| [13] | Zhang, X.; Liu, J.; Wang, L.; Lai, H.-J., Supereulerian bipartite digraphs, J. Graph Theory, 89, 64-75, 2018 · Zbl 1398.05124 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
