Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Mark D. Halsey"'
Autor:
Peter Dolan, Mark D. Halsey
Publikováno v:
Discrete Mathematics. 112(1-3):259-260
The edge dominating number of the random graph G n, 1 2 is shown to be sharply concentrated.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dbaedee7cb16defb3c7183fb8cbfc26
Autor:
Margaret B. Cozzens, Mark D. Halsey
Publikováno v:
Discrete Applied Mathematics. (2-3):125-135
Let the coboxicity of a graph G be denoted by cob(G), and the threshold dimension by t(G). For fixed k≥3, determining if cob(G)≥k and t(G)≤k are both NP-complete problems. We show that if G is a comparability graph, then we can determine if cob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1bfc31e4ea10d4118f9cc8958e08bc4
Autor:
Mark D. Halsey
Publikováno v:
Journal of Combinatorial Theory, Series B. 46(1):118-120
A bijective correspondence is established between extensions of a combinatorial geometry G by the addition of a unique line and parallel structures of G.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd570f77c9e27800ab7a68af2d8418a0