A polynomial time algorithm recognizing link trees

DOI10.1002/jgt.3190190314zbMath0819.05047OpenAlexW2143096528MaRDI QIDQ4698091

No author found.

Publication date: 14 May 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190314

zbMATH Keywords

polynomial time algorithmisomorphism problemslink graphrecognizing link treesZykov problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Trahtenbrot-Zykov problem and NP-completeness ⋮ On extremal sizes of locally k-tree graphs

This page was built for publication: A polynomial time algorithm recognizing link trees