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

DOI10.1016/J.DISC.2010.01.014zbMATH Open1221.05269OpenAlexW2048129667MaRDI QIDQ712245FDOQ712245

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

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)