Alternating signed bipartite graphs and difference-1 colourings
From MaRDI portal
Publication:2197215
DOI10.1016/j.laa.2020.06.030zbMath1447.05098arXiv1911.10869OpenAlexW2990019869MaRDI QIDQ2197215
Kevin Jennings, Rachel Quinlan, Cian O'Brien
Publication date: 28 August 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.10869
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Matrices of integers (15B36) Signed and weighted graphs (05C22)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Patterns of alternating sign matrices
- A theorem on flows in networks
- Matrices of zeros and ones with fixed row and column sum vectors
- Proof of the Macdonald conjecture
- A connection between alternating sign matrices and totally symmetric self- complementary plane partitions
- Proof of the refined alternating sign matrix conjecture
- Alternating sign matrices and hypermatrices, and a generalization of Latin squares
- Inverses and eigenvalues of diamond alternating sign matrices
- Square ice, alternating sign matrices, and classical orthogonal polynomials
- Matroid Intersection
- Maximal Flow Through a Network
- Combinatorial Properties of Matrices of Zeros and Ones
- Matroid intersection algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This page was built for publication: Alternating signed bipartite graphs and difference-1 colourings
