Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Nora Hartsfield"'
Autor:
Wenzhong Liu, Xiaoya Zha, Serge Lawrencenko, Mark N. Ellingham, Beifang Chen, Dong Ye, Nora Hartsfield, Hui Yang
Publikováno v:
Journal of Combinatorial Theory, Series B. 139:1-26
Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their underlying surface
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a34da3e2024f8cc2b440799f62ea525
https://doi.org/10.1016/j.jctb.2019.02.006
https://doi.org/10.1016/j.jctb.2019.02.006
Autor:
Alfred W. Hales, Nora Hartsfield
Publikováno v:
Discrete Mathematics. 309:5259-5263
Define the directed genus, @C(G), of an Eulerian digraph G to be the minimum value of p for which G has a 2-cell embedding in the orientable surface of genus p so that every face of the embedding is bounded by a directed circuit in G. The directed ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07ab9820b2df7fd9d1505c923a4cffe6
https://doi.org/10.1016/j.disc.2007.11.003
https://doi.org/10.1016/j.disc.2007.11.003
Autor:
Nora Hartsfield, Gerhard Ringel
'Innovative introductory text... clear exposition of unusual and more advanced topics... Develops material to substantial level.'— American Mathematical Monthly'Refreshingly different... an ideal training ground for the mathematical process of inve
Publikováno v:
Journal of Graph Theory. 38:42-64
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83143d698f428eb54e3cdbad22a5ad87
https://doi.org/10.1002/jgt.1023
https://doi.org/10.1002/jgt.1023
Autor:
Nora Hartsfield, William F. Smyth
Publikováno v:
Discrete Mathematics. 141:163-171
Given an integer r > 0, let Gr, = (Vr, E) denote a graph consisting of a simple finite undirected graph G = (V, E) of order n and size m together with r isolated vertices . Then | V | = n, |Vr| = n+r, and |E| = m. Let L:Vr → + denote a labelling of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdf01475429d4d14e464b0bf715fff45
https://doi.org/10.1016/0012-365x(93)e0196-b
https://doi.org/10.1016/0012-365x(93)e0196-b
Autor:
Dan Archdeacon, Nora Hartsfield
Publikováno v:
Journal of Combinatorial Theory, Series B. 54:249-256
In this paper we examine self-dual embeddings of the complete bipartite graph K n , m on both orientable and nonorientable surfaces. It can be quickly established that such an embedding can exist only if both n and m are even integers exceeding 2. We
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fbc23ffa24e0e9695b53dfb5ea56ec2
https://doi.org/10.1016/0095-8956(92)90056-4
https://doi.org/10.1016/0095-8956(92)90056-4
Autor:
Nora Hartsfield, Gerhard Ringel
Publikováno v:
Combinatorica. 11:145-155
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7952a2dcc1762f1312a0a8fa2066c4a2
https://doi.org/10.1007/bf01206358
https://doi.org/10.1007/bf01206358
Publikováno v:
The American Mathematical Monthly. 98:873
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1c21ff2e8294c057e207aaa5e233500
https://doi.org/10.2307/2324291
https://doi.org/10.2307/2324291
Autor:
Nora Hartsfield
Publikováno v:
Discrete Mathematics. 62(1):35-47
The splitting number of a graph on a surface is defined, and a formula for the splitting number of the complete graph on the torus is established. The method of proof is to use Euler's generalized polyhedral formula for the lower bound, then current
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51d11df3a23b281d530bff5c06c4e19a