Zobrazeno 1 - 10
of 190
pro vyhledávání: '"Gobel, F."'
Publikováno v:
In Chirurgie de la main October 2015 34(5):245-250
Publikováno v:
In Annales de chirurgie plastique esthetique 2011 56(4):280-286
Autor:
Gobel, F., Nederpelt, R. P.
Publikováno v:
The American Mathematical Monthly, 1971 Dec 01. 78(10), 1097-1103.
Externí odkaz:
https://www.jstor.org/stable/2316312
Autor:
Gobel, F., Carlitz, L.
Publikováno v:
SIAM Review, 1969 Jul 01. 11(3), 402-406.
Externí odkaz:
https://www.jstor.org/stable/2028954
Autor:
Gobel, F.
Publikováno v:
SIAM Review, 1970 Jan 01. 12(1), 151-153.
Externí odkaz:
https://www.jstor.org/stable/2029065
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Discrete mathematics, 170(170), 219-222. Elsevier
A spanning tree of a connected graph G is said to be an independency tree if all its endvertices are pairwise nonadjacent in G. We prove that a connected graph G has no independency tree if and only if G is a cycle, a complete graph or a complete bip
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::090ffb4e6f4968708620f8cd5542931f
https://doi.org/10.1016/s0012-365x(96)00306-8
https://doi.org/10.1016/s0012-365x(96)00306-8
Publikováno v:
The American Mathematical Monthly, 1969 Jun 01. 76(6), 710-711.
Externí odkaz:
https://www.jstor.org/stable/2316714
Publikováno v:
Journal of graph theory, 17(5), 613-620. Wiley-Liss Inc.
We prove that all 3-connected 4-regular planar graphs can be generated from the Octahedron Graph, using three operations. We generated these graphs up to 15 vertices inclusive. Moreover, by including a fourth operation we obtain an alternative to a p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e40ab35cc9df7cbde709499e7c03763
https://doi.org/10.1002/jgt.3190170508
https://doi.org/10.1002/jgt.3190170508
Autor:
Gobel, F.
In an attempt to prove the double-cycle-conjecture for cubic graphs, C. Hoede formulated the following combinatorial problem. “Given a partition of {1, 2, . . . , 3n} into n equal classes, is it possible to choose from each class a number such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::9f39c04bc88f92c8dd310038f081bab7
https://research.utwente.nl/en/publications/hoedesequences(46b3630a-c74f-4845-aa86-f61fd18f49d3).html
https://research.utwente.nl/en/publications/hoedesequences(46b3630a-c74f-4845-aa86-f61fd18f49d3).html
