Graph folding and programmable logic array

Authors:
T. C. Hu;Y. S. Kuo
Affiliations:
Univ. of California at San Diego, La Jolla;-
Venue:
Networks
Year:
1987

Citing 0
Cited 4

The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle

Discrete Mathematics
Paths and trails in edge-colored graphs

Theoretical Computer Science
Links in edge-colored graphs

European Journal of Combinatorics
Complexity of paths, trails and circuits in arc-colored digraphs

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract