Cycle decomposition by disjoint transpositions

DOI10.1016/0097-3165(72)90010-6zbMath0314.05005MaRDI QIDQ1220515

Abraham Lempel, Martin Cohn

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(72)90010-6

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

05A05: Permutations, words, matrices

05B15: Orthogonal arrays, Latin squares, Room squares

Related Items

VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS, An invariant of graph-links valued in graphs and an almost classification of graph-links, Graph-links: nonrealizability, orientation, and Jones polynomial, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, Notes on a theorem of Naji, Parity in knot theory and graph-links, Binary matroids and local complementation, The transition matroid of a 4-regular graph: an introduction, On the linear algebra of local complementation, Splitting cubic circle graphs, Isotropic matroids. II: Circle graphs, Chords in a circle and linear algebra over GF(2), On the cycle structure of permutation polynomials, Cycle decomposition by transpositions, An obstruction to embedding graphs in surfaces, On a formula for the number of Euler trails for a class of digraphs, Counting orbits of a product of permutations, On the product of certain permutations, Binary nullity, Euler circuits and interlace polynomials, Nullity invariance for pivot and the interlace polynomial, Ribbon graphs and bialgebra of Lagrangian subspaces, EMBEDDINGS OF *-GRAPHS INTO 2-SURFACES, Checkerboard embeddings of *-graphs into nonorientable surfaces, A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS, DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES, A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS, A parity map of framed chord diagrams, A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS, Flows on hypermaps

Cites Work

• On extremal factors of the de Bruijn graph
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Counting with Nonlinear Binary Feedback Shift Registers
• Unnamed Item