Successful pressing sequences for a bicolored graph and binary matrices

DOI10.1016/j.laa.2015.11.001zbMath1331.05140arXiv1502.07450OpenAlexW2963633439MaRDI QIDQ898795

N. E. Zubov

Publication date: 18 December 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.07450

zbMATH Keywords

matchingadjacency matrixbinary matrixpressing sequencebicolored graph

Mathematics Subject Classification ID

Problems related to evolution (92D15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Sorting by reversals and the theory of 4-regular graphs ⋮ Uniquely pressable graphs: characterization, enumeration, and recognition ⋮ A new characterization of \(\mathcal{V} \)-posets

Cites Work

• A very elementary presentation of the Hannenhalli-Pevzner theory
• Transforming cabbage into turnip
• Unnamed Item

This page was built for publication: Successful pressing sequences for a bicolored graph and binary matrices