Zobrazeno 1 - 10
of 45
pro vyhledávání: '"MINGQUAN ZHAN"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 1, p 297 (2024)
Externí odkaz:
https://doaj.org/article/022af049682d4425a9b5d3a29923a300
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 679-690 (2020)
A graph is supereulerian if it has a spanning closed trail. Catlin in 1990 raised the problem of determining the reduced nonsupereulerian graphs with small orders, as such results are of particular importance in the study of Eulerian subgraphs and Ha
Externí odkaz:
https://doaj.org/article/2e7b9cb208ea4c00aa1e0a6e3ec2f1c6
Publikováno v:
Discrete Applied Mathematics. 295:102-111
For a graph G , an integer s ≥ 0 and distinct vertices u , v ∈ V ( G ) , an ( s ; u , v ) -path-system of G is a subgraph H consisting of s internally disjoint ( u , v ) -paths. The spanning connectivity κ ∗ ( G ) is the largest integer s such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5386e8af1a28685df374853a48e17b3d
https://doi.org/10.1016/j.dam.2021.02.019
https://doi.org/10.1016/j.dam.2021.02.019
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 43:4375-4391
Let $$\alpha '(G), ess'(G), \kappa (G), \kappa '(G), N_G(v)$$ and $$D_i(G)$$ denote the matching number, essential edge connectivity, connectivity, edge connectivity, the set of neighbors of v in G and the set of degree i vertices of a graph G, respe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f00dd20ffe814d7c535911ba9a573a9
https://doi.org/10.1007/s40840-020-00928-5
https://doi.org/10.1007/s40840-020-00928-5
Publikováno v:
Discussiones Mathematicae Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53ad129a08937fe75ac29428eb0d0286
https://doi.org/10.7151/dmgt.2448
https://doi.org/10.7151/dmgt.2448
Publikováno v:
Discrete Mathematics. 346:113210
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::de1813162392eb230bfd81fc612bec7a
https://doi.org/10.1016/j.disc.2022.113210
https://doi.org/10.1016/j.disc.2022.113210
Publikováno v:
Discrete Mathematics. 342:3006-3016
For an integer s ≥ 0 , a graph G is s -hamiltonian if for any vertex subset S ⊆ V ( G ) with | S | ≤ s , G − S is hamiltonian, and G is s -hamiltonian connected if for any vertex subset S ⊆ V ( G ) with | S | ≤ s , G − S is hamiltonian
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4048ef1b1e794a95f116029bcad4566
https://doi.org/10.1016/j.disc.2019.06.006
https://doi.org/10.1016/j.disc.2019.06.006
Publikováno v:
Discrete Mathematics. 345:112745
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af8476d5e3f70c98f0660fa374115de7
https://doi.org/10.1016/j.disc.2021.112745
https://doi.org/10.1016/j.disc.2021.112745
Publikováno v:
Graphs and Combinatorics. 35:67-89
A graph G is said to be pancyclic if G contains cycles of lengths from 3 to |V(G)|. For a positive integer i, we use $$Z_i$$ to denote the graph obtained by identifying an endpoint of the path $$P_{i+1}$$ with a vertex of a triangle. In this paper, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6225d151b92462a9a709415eebca8c6
https://doi.org/10.1007/s00373-018-1987-4
https://doi.org/10.1007/s00373-018-1987-4
