4 papers
A Canonical m-Atomic Decomposition of Bipartite Graphs via a Grid Model
Béla Jónás
We study finite, connected, simple bipartite graphs in a grid model, in which a graph is drawn as a rectangular array and its structure is read off from empty subrectangles, called…
Another proof of Cruse's theorem and a new necessary condition for completion of partial Latin squares (Part 3.)
Béla Jónás
A partial Latin square of order n can be represented by a 3-dimensional chess-board of size n x n x n with at most n^2 non-attacking rooks. Based on this representation, we give pr…
Analysis of subsystems with rooks on a chess-board representing a partial Latin square (Part 2.)
Béla Jónás
A partial Latin square of order n can be represented by a 3-dimensional chess-board of size n x n x n with at most n^2 non-attacking rooks. In Latin squares, a subsystem and its re…
Distribution of rooks on a chess-board representing a Latin square partitioned by a subsystem
Béla Jónás
A d-dimensional generalization of a Latin square of order n is a chess-board of size n x n x ... x n (d times) carrying n^(d-1) non-attacking rooks, equivalently a high-dimensional…