Pivots, determinants, and perfect matchings of graphs
From MaRDI portal
Publication:714808
DOI10.1016/j.tcs.2012.02.031zbMath1251.05132arXiv0811.3500OpenAlexW2041707611MaRDI QIDQ714808
Robert Brijder, Hendrik Jan Hoogeboom, Tero J.Harju
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.3500
principal pivot transformperfect matchingslocal complementationcircle graphgene assembly in ciliates
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Genetics and epigenetics (92D10)
Related Items (5)
Maximal pivots on graphs with an application to gene assembly ⋮ Graph reductions, binary rank, and pivots in gene assembly ⋮ Nullity invariance for pivot and the interlace polynomial ⋮ The group structure of pivot and loop complementation on graphs and set systems ⋮ Pivots, determinants, and perfect matchings of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph reductions, binary rank, and pivots in gene assembly
- The group structure of pivot and loop complementation on graphs and set systems
- Characterizing the micronuclear gene patterns in ciliates
- The interlace polynomial of a graph
- Pivots, determinants, and perfect matchings of graphs
- Parallelism in gene assembly
- Edge local complementation and equivalence of binary linear codes
- A generalization of Tutte's characterization of totally unimodular matrices
- Computation in living cells. Gene assembly in ciliates
- Formal systems for gene assembly in ciliates.
- Principal pivot transforms: Properties and applications
- The parity of the number of 1-factors of a graph
- Rank-width and vertex-minors
- Local unitary versus local Clifford equivalence of stabilizer states
- String and graph reduction systems for gene assembly in ciliates
- Transforming cabbage into turnip
This page was built for publication: Pivots, determinants, and perfect matchings of graphs