( en | de | ru )

 

Disambiguation of "Erdös, Paul"

Author of the publication

copydeleteadd this publication to your clipboard
Hypercube subgraphs with minimal detours.

, , , and . J. Graph Theory, 23 (2): 119-128 (1996)

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. You can also use the button next to the name to display some publications already assigned to the person.

Erwin Erdös

György Erdös

Georg Erdös

Gabor Erdös

Adorján Miklós Erdös

 

Other publications of authors with the same name

On additive partitions of integers., , and . Discret. Math., 22 (3): 201-211 (1978)Crossing Families., , , , , , and . SCG, page 351-356. ACM, (1991)Bounds on threshold dimension and disjoint threshold coverings (abstract only)., , and . ACM Conference on Computer Science, page 422. ACM, (1985)New Ramsey Bounds from Cyclic Graphs of Prime Order., , and . SIAM J. Discret. Math., 10 (3): 381-387 (1997)Local constraints ensuring small representing sets., , and . J. Comb. Theory A, 58 (1): 78-84 (1991)Graphs with certain families of spanning trees., , , and . J. Comb. Theory B, 32 (2): 162-170 (1982)A note of welcome.. J. Graph Theory, 1 (1): 3 (1977)Tight bounds on the chromatic sum of a connected graph., , , , and . J. Graph Theory, 13 (3): 353-357 (1989)Gaps in Difference Sets, and the Graph of Nearly Equal Distances., , , and . Applied Geometry And Discrete Mathematics, volume 4 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 265-274. DIMACS/AMS, (1990)On the chromatic index of almost all graphs., and . J. Comb. Theory B, 23 (2-3): 255-257 (1977)