Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Addisu Paulos"'
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:2028-2050
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bba136f88d3b66642ffa20f595176b7a
https://doi.org/10.1137/21m140657x
https://doi.org/10.1137/21m140657x
Publikováno v:
Discrete Applied Mathematics. 317:75-85
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c7d817599e1aeed467275a8eda72750
https://doi.org/10.1016/j.dam.2022.04.007
https://doi.org/10.1016/j.dam.2022.04.007
Publikováno v:
Journal of Graph Theory. 99:378-398
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f944d00159509a284ca898628d5724a0
https://doi.org/10.1002/jgt.22745
https://doi.org/10.1002/jgt.22745
Publikováno v:
Discrete Applied Mathematics. 289:262-269
The Wiener index of a graph G , denoted W ( G ) , is the sum of the distances between all non-ordered pairs of vertices in G .E. Czabarka, et al. conjectured that for a simple quadrangulation graph G on n vertices, n ≥ 4 , W ( G ) ≤ 1 12 n 3 + 7
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b281da38f8ddc2adc4ae38ecd26d9d2
https://doi.org/10.1016/j.dam.2020.11.016
https://doi.org/10.1016/j.dam.2020.11.016
Publikováno v:
Journal of Combinatorial Optimization. 40:1121-1135
The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an n-vertex maximal planar graph is at most $$\lfloor \frac{1}{18}(n^3+3n^2)\rfloor $$ ⌊ 1 18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e12b02cba40971423aae9d0d9d3ab1d
https://doi.org/10.1007/s10878-020-00655-4
https://doi.org/10.1007/s10878-020-00655-4
Publikováno v:
The Electronic Journal of Combinatorics. 28
In a generalized Turán problem, we are given graphs $H$ and $F$ and seek to maximize the number of copies of $H$ in an $n$-vertex graph not containing $F$ as a subgraph. We consider generalized Turán problems where the host graph is planar. In part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac86b95b20f76269d1a810f9e44765fe
https://doi.org/10.37236/9603
https://doi.org/10.37236/9603
Publikováno v:
Trends in Mathematics ISBN: 9783030838225
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6f4736bc7336ad4292c42ddde3957a8
https://doi.org/10.1007/978-3-030-83823-2_41
https://doi.org/10.1007/978-3-030-83823-2_41
Let $f(n,H)$ denote the maximum number of copies of $H$ possible in an $n$-vertex planar graph. The function $f(n,H)$ has been determined when $H$ is a cycle of length $3$ or $4$ by Hakimi and Schmeichel and when $H$ is a complete bipartite graph wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02a8e39a5882b749a819547a2761c2fd
Autor:
Oscar Zamora, Ryan Martin, Chuanqi Xiao, Ervin Győri, Debarun Ghosh, Nika Salia, Addisu Paulos
Publikováno v:
Discrete Mathematics. 344:112317
Let f(n, H) denote the maximum number of copies of H possible in an n-vertex planar graph. The function f(n, H) has been determined when H is a cycle of length 3 or 4 by Hakimi and Schmeichel and when H is a complete bipartite graph with smaller part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29af634a7ebebb0e1252083acacc3ba4
https://doi.org/10.1016/j.disc.2021.112317
https://doi.org/10.1016/j.disc.2021.112317