Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube

DOI10.1002/jgt.22175zbMath1386.05119OpenAlexW2743257604WikidataQ113402250 ScholiaQ113402250MaRDI QIDQ4638647

Burkhard Monien, Gerd Wechsung

Publication date: 27 April 2018

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

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

zbMATH Keywords

hypercubescaterpillargraph embeddings

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube