Cycle decomposition by disjoint transpositions

DOI10.1016/0097-3165(72)90010-6zbMath0314.05005OpenAlexW1983401286MaRDI 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

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

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

Cites Work

• Unnamed Item
• 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