Generation of colour-constrained spanning trees with application in symbolic circuit analysis

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-007X(199609/10)24:5<597::AID-CTA938>3.0.CO;2-Q" /><597::AID-CTA938>3.0.CO;2-Q 10.1002/(SICI)1097-007X(199609/10)24:5<597::AID-CTA938>3.0.CO;2-QzbMath0904.94032OpenAlexW1973129097MaRDI QIDQ4355497

Qicheng Yu, Carl Sechen

Publication date: 12 August 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-007x(199609/10)24:5<597::aid-cta938>3.0.co;2-q

zbMATH Keywords

spanning treessymbolic circuit analysis

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Generation of colour-constrained spanning trees with application in symbolic circuit analysis