Zobrazeno 1 - 10
of 151
pro vyhledávání: '"David Barnette"'
Autor:
Leamy, John
Publikováno v:
The Mathematics Teacher, 1985 Feb 01. 78(2), 150-150.
Externí odkaz:
https://www.jstor.org/stable/27964418
Autor:
Anderson, Ian
Publikováno v:
The Mathematical Gazette, 1987 Mar 01. 71(455), 87-87.
Externí odkaz:
https://www.jstor.org/stable/3616327
Autor:
Ian Anderson
Publikováno v:
The Mathematical Gazette. 71:87-87
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f01595840974cb79d99a919ca521faca
https://doi.org/10.2307/3616327
https://doi.org/10.2307/3616327
Publikováno v:
International Ophthalmology Clinics. 49:1-16
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61cafc7cecc4a403f8ed14101469c126
https://doi.org/10.1097/iio.0b013e3181b7ebe8
https://doi.org/10.1097/iio.0b013e3181b7ebe8
Autor:
Shelley Gillet, David Barnette
Publikováno v:
Discrete Mathematics. 195:239-243
Although questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65e687388557ef2db82de4f77cf744bc
https://doi.org/10.1016/s0012-365x(98)00185-x
https://doi.org/10.1016/s0012-365x(98)00185-x
Autor:
David Barnette
Publikováno v:
Israel Journal of Mathematics. 86:397-407
We show that the 3-connected graphs can be generated from the complete graph on four vertices and the complete 3,3 bipartite graph by adding vertices and adding edges with endpoints on two edges meeting at a 3-valent vertex.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d1e830063c03839e059857aebb05e21
https://doi.org/10.1007/bf02773688
https://doi.org/10.1007/bf02773688
Autor:
David Barnette, Adrian Riskin
Publikováno v:
Discrete Mathematics. 131(1-3):211-219
In this paper we show that if attention is restricted to polyhedral embeddings of graphs, no theorem analogous to the Duke interpolation theorem for 2-cell embeddings is true. We also give two interesting classes of graphs: (i) a class in which the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc2a7ea4ca3950261131a9e624e767e1
Autor:
David Barnette
Publikováno v:
Geometriae Dedicata. 46:211-214
We construct the first known polyhedral 2-manifoldM that does not have thew v-property, i.e. there are two verticesx andy inM such that any path fromx toy must revisit some face of the manifold.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd6fcffd6716c6514c4be0c0415a8c9b
https://doi.org/10.1007/bf01264920
https://doi.org/10.1007/bf01264920
Autor:
David Barnette
Publikováno v:
Israel Journal of Mathematics. 79:251-256
We show that the vertices of the graph of any polyhedral map on the projective plane, torus or Klein bottle can be covered by a subgraph that is a tree of maximum valence 3. This extends a theorem of the author, who previously proved this theorem for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc11b5e563a9842dc3262c39068e8f56
https://doi.org/10.1007/bf02808218
https://doi.org/10.1007/bf02808218
Autor:
David Barnette
Publikováno v:
Israel Journal of Mathematics. 79:161-172
An embedding of a multi-graph in a manifold is a closed 2-cell embedding provided the closures of the faces are all closed 2-cells. In this paper we characterized the projective planar multi-graphs that have closed 2-cell embeddings in the projective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::404f1898532002bc4e8111a6fc6154aa
https://doi.org/10.1007/bf02808213
https://doi.org/10.1007/bf02808213