Pages that link to "Item:Q1894366"
From MaRDI portal
The following pages link to Permuting matrices to avoid forbidden submatrices (Q1894366):
Displayed 20 items.
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Enumeration of \((0.1)\)-matrices avoiding some \(2 \times 2\) matrices (Q442351) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- On probe interval graphs (Q1281778) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- On the recognition of permuted bottleneck Monge matrices (Q1902890) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Self‐clique graphs and matrix permutations (Q4446891) (← links)
- (Q5005172) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- Large Homogeneous Submatrices (Q5855527) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← links)
- Comparability digraphs: an analogue of comparability graphs (Q6177431) (← links)
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)