Graph folding and programmable logic array
From MaRDI portal
Publication:3794208
DOI10.1002/net.3230170103zbMath0649.05038OpenAlexW2076505206MaRDI QIDQ3794208
No author found.
Publication date: 1987
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230170103
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)
Related Items (7)
PLA folding in special graph classes ⋮ Acyclicity in edge-colored graphs ⋮ Paths and trails in edge-colored graphs ⋮ Proper Hamiltonian paths in edge-coloured multigraphs ⋮ Parallel connectivity in edge-colored complete graphs: complexity results ⋮ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs ⋮ Links in edge-colored graphs
This page was built for publication: Graph folding and programmable logic array
