A result on k-valent graphs and its application to a graph embedding problem

DOI10.1007/BF00292113zbMath0615.05027OpenAlexW1983044489MaRDI QIDQ1820789

Paul E. Dunne

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00292113

zbMATH Keywords

spanning treegraph embeddinggrid graphs

Mathematics Subject Classification ID

Trees (05C05)

Related Items (1)

Lower bounds on the area complexity of Boolean circuits

Cites Work

• Universality considerations in VLSI circuits
• Balanced matrices and property (G)

This page was built for publication: A result on k-valent graphs and its application to a graph embedding problem