×

zbMATH — the first resource for mathematics

Combinatorial algorithms on a class of graphs. (English) Zbl 0941.68589

MSC:
68Q25 Analysis of algorithms and problem complexity
68R10 Graph theory (including graph drawing) in computer science
05C45 Eulerian and Hamiltonian graphs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Duffin, R.J., Topology of series-parallel networks, J. math. appl., 10, 303-318, (1965) · Zbl 0128.37002
[2] Goodman, S.; Hedetniemi, S.; Slater, P.J., Advances on the Hamiltonian completion problem, J. ACM, 22, 3, 352-360, (1975) · Zbl 0307.05123
[3] Harary, F., Graph theory, (1969), Addison-Wesley Reading, MA · Zbl 0797.05064
[4] Takamizawa, K.; Nishizeki, T.; Saito, N., Linear-time computability of combinatorial problems on series-parallel graphs, (), 79-94 · Zbl 0485.68055
[5] Takamizawa, K.; Nishizeki, T.; Saito, N., Linear-time computability of combinatorial problems on series-parallel graphs, J. ACM, 29, 3, 623-641, (1982) · Zbl 0485.68055
[6] Valdez, J.; Tarjan, R.E.; Lawler, E.L.; Valdez, J.; Tarjan, R.E.; Lawler, E.L., The recognition of series-parallel graphs, Proceedings 11th STOC, SIAM J. comput., 11, 298-313, (1982), also in · Zbl 0478.68065
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.