Matches in DBpedia 2015-10 for { ?s ?p "In graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path.Caterpillars were first studied in a series of papers by Harary and Schwenk. The name was suggested by A. Hobbs. As Harary & Schwenk (1973) colorfully write, "A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoints is removed.""@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Caterpillar_tree abstract "In graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path.Caterpillars were first studied in a series of papers by Harary and Schwenk. The name was suggested by A. Hobbs. As Harary & Schwenk (1973) colorfully write, "A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoints is removed."".
- Caterpillar_tree comment "In graph theory, a caterpillar or caterpillar tree is a tree in which all the vertices are within distance 1 of a central path.Caterpillars were first studied in a series of papers by Harary and Schwenk. The name was suggested by A. Hobbs. As Harary & Schwenk (1973) colorfully write, "A caterpillar is a tree which metamorphoses into a path when its cocoon of endpoints is removed."".