On graphs in which two vertices are distinguished-Reference-Cited by-同舟云学术

On graphs in which two vertices are distinguished

Published:1964-05 Issue:3-4 Volume:12 Page:377-397
ISSN:0001-5954
Container-title:Acta Mathematica Academiae Scientiarum Hungaricae
language:en
Short-container-title:Acta Mathematica Academiae Scientiarum Hungaricae

Author:

Ádám A.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/BF02023922.pdf

Reference12 articles.

1. A. Ádám, Kétpólusú elektromos hálózatokról. I. (Über zweipolige elektrische Netze. I.),MTA Mat. Kut. Int. Közl.,2 (1957), pp. 211–218. Hungarian, with Russian and German summaries

2. A. Ádám, Kétpólusú elektromos hálózatokról. II, ibid. (1958), pp. 67–79. Hungarian, with Russian and German summaries.

3. A. Ádám, Kétpólusú elektromos hálózatokról. III, ibid. (1958), pp. 207–218. Hungarian, with Russian and German summaries.

4. A. Ádám, Kétpólusú elektromos hálózatokról. IV, ibid. (1959), pp. 183–190. Hungarian, with Russian and German summaries.

5. C. C. Elgot andJ. B. Wright, Series-parallel graphs and lattices,Duke Math. Journal,26 (1959), pp. 325–338.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Semiring on Convex Polygons and Zero-Sum Cycle Problems;SIAM Journal on Computing;1990-10

2. Triconnected decomposition for computingK-terminal network reliability;Networks;1989-03

3. A compact labeling scheme for series-parallel graphs;Discrete Applied Mathematics;1985-07

4. The Recognition of Series Parallel Digraphs;SIAM Journal on Computing;1982-05