Perfect matchings of a graph associated with a binary de Bruijn digraph

DOI10.1016/J.DISC.2010.01.014MaRDI QIDQ712245zbMATH OpenOpenAlexFDO

Authors D. Kharzeev

Publication date 28 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.01.014

zbMATH Keywords

matchingcompositionde Bruijn digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 3987
• Perfect factors in the de Bruijn graph
• Particular cycles of a binary de Bruijn digraph
• The Hamiltonian property of generalized de Bruijn digraphs
• scientific article; zbMATH DE number 4112647

Cited in

(3)

• A pretty, surprising, graph graft
• Quasisymmetric and Schur expansions of cycle index polynomials
• Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs

This page was built for publication: Perfect matchings of a graph associated with a binary de Bruijn digraph

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