From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Sweeping Graphs with Large Clique Number.

B. Yang, D. Dyer, и B. Alspach. ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 908-920. Springer, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Lower Bounds on Edge Searching.B. Alspach, D. Dyer, D. Hanson, и B. Yang. ESCAPE, том 4614 из Lecture Notes in Computer Science, стр. 516-527. Springer, (2007)Paley graphs have Hamilton decompositions.B. Alspach, D. Bryant, и D. Dyer. Discret. Math., 312 (1): 113-118 (2012)Matching designs.B. Alspach, и K. Heinrich. Australas. J Comb., (1990)Small 2-coloured path decompositions.B. Alspach, D. Dyer, и K. Heinrich. Ars Comb., (2012)Honeycomb toroidal graphs are Cayley graphs.B. Alspach, и M. Dean. Inf. Process. Lett., 109 (13): 705-708 (2009)On factor-invariant graphs.B. Alspach, A. Khodadadpour, и D. Kreher. Discret. Math., 342 (8): 2173-2178 (2019)Honeycomb Toroidal Graphs.B. Alspach. Bull. ICA, (2021)Sweeping Graphs with Large Clique Number.B. Yang, D. Dyer, и B. Alspach. ISAAC, том 3341 из Lecture Notes in Computer Science, стр. 908-920. Springer, (2004)Lifting Hamilton cycles of quotient graphs.B. Alspach. Discret. Math., 78 (1-2): 25-36 (1989)The hamilton spaces of cayley graphs on abelian groups.B. Alspach, S. Locke, и D. Witte. Discret. Math., 82 (2): 113-126 (1990)