Design and serial construction of digraph braids

DOI10.1080/17513472.2015.1007410MaRDI QIDQ3453872zbMATH OpenOpenAlexFDO

Authors David Jacob Wildstrom

Publication date 1 December 2015

Published in Journal of Mathematics and the Arts (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/17513472.2015.1007410

zbMATH Keywords

acyclic digraphsbraidsdecomposabilitydigraphsknot theorytournaments

Mathematics Subject Classification ID

Mathematics and visual arts (00A66) Directed graphs (digraphs), tournaments (05C20) Braid groups; Artin groups (20F36)

Recommendations

• scientific article; zbMATH DE number 2165838
• scientific article; zbMATH DE number 857070
• Braids: generalizations, presentations and algorithmic properties.
• Recursive constructions for cyclic BIB designs and their generalizations
• Construction of graceful digraphs using algebraic structures
• Braid presentation of spatial graphs
• Braids via term rewriting
• Combinatorics of normal sequences of braids
• scientific article; zbMATH DE number 1229613
• Divisible design digraphs

Cites work

• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
• A short proof of a theorem of Reid and Parker on tournaments
• A solution of the isomorphism problem for circulant graphs
• Developing a mathematical model for bobbin lace
• Disproof of a conjecture of Erdös and moser on tournaments
• On tournaments and their largest transitive subtournaments
• On tournaments free of large transitive subtournaments

Cited in

(1)

• Constructing a braid of partitions from hierarchies of partitions

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Design and serial construction of digraph braids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453872)