Zobrazeno 1 - 10
of 12
pro vyhledávání: '"D. H. Younger"'
Autor:
D. H. Younger
Publikováno v:
Biographical Memoirs of Fellows of the Royal Society. 58:283-297
William Tutte, born in Newmarket, completed a master’s degree in chemistry at Cambridge at the end of 1940, whereupon he was recruited to work at Bletchley Park as a cryptographer. He became the primary person responsible for breaking the Fish code
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c84d581201f8d57c557cba1bd866bac
https://doi.org/10.1098/rsbm.2012.0036
https://doi.org/10.1098/rsbm.2012.0036
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.
Autor:
D. H. Younger
Publikováno v:
Journal of Combinatorial Theory, Series B. 92(2):193-198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25af92393a72632954ddac6aa9690644
Autor:
D. H. Younger
Publikováno v:
Annals of the New York Academy of Sciences. 319:555-562
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e4519a03c8cd86306c2b0f848fd2508
https://doi.org/10.1111/j.1749-6632.1979.tb32836.x
https://doi.org/10.1111/j.1749-6632.1979.tb32836.x
Autor:
K. Vidyasankar, D. H. Younger
Publikováno v:
Canadian Journal of Mathematics. 27:348-351
As an analog of a recently established minimax equality for directed graphs [1], I. Simon has suggested that the following be investigated.1.1. For a finite acyclic directed graph G, a minimum collection of directed coboundaries whose union is the ed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88377f8bcd7d416029ad9e1373d0b470
https://doi.org/10.4153/cjm-1975-042-7
https://doi.org/10.4153/cjm-1975-042-7
Publikováno v:
Journal of the London Mathematical Society. :369-374
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27b6ba63a1413adf3c09e02c1d7442c3
https://doi.org/10.1112/jlms/s2-17.3.369
https://doi.org/10.1112/jlms/s2-17.3.369
Autor:
D. H. Younger
Publikováno v:
Journal of Graph Theory. 7:349-357
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcdf0f7d47eeafed2d85780b64c56fef
https://doi.org/10.1002/jgt.3190070307
https://doi.org/10.1002/jgt.3190070307
Autor:
D. H. Younger, Paulo Feofiloff
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Concerning the conjecture that in every directed graph, a maximum packing of directed cut transversals is equal in cardinality to a minimum directed cut, a proof is given for the side coboundaries of a graph. This case includes, and is essentially eq
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7843fc382bbdbf6faf16d7cea415529
https://doi.org/10.1007/bf02579302
https://doi.org/10.1007/bf02579302
Autor:
D. H. Younger, I. P. McWhirter
Publikováno v:
Journal of the London Mathematical Society. :86-90
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d32f8bada471aa7a16e4fdaeb4c65f24
https://doi.org/10.1112/jlms/s2-3.1.86
https://doi.org/10.1112/jlms/s2-3.1.86
Autor:
D. H. Younger, G. B. Faulkner
Publikováno v:
Discrete Mathematics. 7(1-2):67-74
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::145a183c3abc7d6c2e9ee674ed9a83e2