#### 577 Citations

On Structural Rank and Resilience of Sparsity Patterns

- Mathematics
- 2021

A sparsity pattern in Rn×m, for m ≥ n, is a vector subspace of matrices admitting a basis consisting of canonical basis vectors in Rn×m. We represent a sparsity pattern by a matrix with 0/?-entries,… Expand

SOME ASPECTS ON SOLVING TRANSPORTATION PROBLEM

- 2020

In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices to these transportation problems are of… Expand

Some aspects on solving transportation problem

- Mathematics
- 2020

In this paper, we consider a class of transportation problems which arises in sample surveys and other areas of statistics. The associated cost matrices of these transportation problems are of… Expand

Graph Edge Coloring: A Survey

- Mathematics, Computer Science
- Graphs Comb.
- 2019

This survey, written for the non-expert, shall describe some main results and techniques in graph edge coloring and state some of the many popular conjectures in the theory. Expand

Circulant association schemes on triples

- Mathematics
- 2021

Association Schemes and coherent configurations (and the related Bose-Mesner algebra and coherent algebras) are well known in combinatorics with many applications. In the 1990s, Mesner and… Expand

Doubly stochastic matrices and Schur-Weyl duality for partition algebras

- Mathematics
- 2021

In 1916 Dénes König proved that the permanent of a doubly stochastic matrix is positive; equivalently, the matrix has a positive diagonal. König’s result is equivalent to Birkhoff’s 1946 result, that… Expand

List colouring of two matroids through reduction to partition matroids

- Mathematics, Computer Science
- ArXiv
- 2019

The present paper considers matroid classes that appear naturally in combinatorial and graph optimization problems, namely graphic matroids, pavingMatroids and gammoids, and shows that if both matros are from these fundamental classes, then the list colouring number is at most twice the colouringnumber. Expand

Choosability in coloring problems of graphs with restricted color lists

- Mathematics, Computer Science
- 2017 XLIII Latin American Computer Conference (CLEI)
- 2017

This work applied special techniques to prove the property of choosability in some classes of graphs, involving a general proof for simple graphs, which guarantees that if a graph is k-colorable it is also k-(Y, μ)-choosable, being the computational complexity reduced from the class Π2p-complete to the NP-complete. Expand