The existence of two simple perfect square-cylinders of order 20 is discussed. So far, the lowest order simple perfect square-cylinders known, are of order 24, due to [1.]
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their de...
The procedure is proposed for obtaining the complexity numbers of square-cell configurations. It is ...
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylin...
AbstractThe existence of two simple perfect square-cylinders of order 20 is discussed. So far, the l...
Introduction A perfect squared square of order n is a square dissected into a finite number n of squ...
AbstractTransformation techniques due to Federico and Willcocks are applied to obtain the first know...
Transformation techniques due to Federico and Willcocks are applied to obtain the first known simple...
AbstractSuppose a square or a 1:2 rectangle is dissected into 1:2 rectangular elements of different ...
International audienceWe extend the notion of canonical orderings to cylindric triangulations. This ...
The chromatic number of a graph G is the least number of colours that can be assigned to the vertic...
International audienceWe extend the notion of canonical ordering, initially developed for planar tri...
37 pagesWe extend the notion of canonical ordering (initially developed for planar triangulations an...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
We extend the notion of canonical orderings to cylindric triangulations. This allows us to extend th...
A compound perfect squared square must contain at least 22 subsquares. The proof utilizes elementary...
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their de...
The procedure is proposed for obtaining the complexity numbers of square-cell configurations. It is ...
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylin...
AbstractThe existence of two simple perfect square-cylinders of order 20 is discussed. So far, the l...
Introduction A perfect squared square of order n is a square dissected into a finite number n of squ...
AbstractTransformation techniques due to Federico and Willcocks are applied to obtain the first know...
Transformation techniques due to Federico and Willcocks are applied to obtain the first known simple...
AbstractSuppose a square or a 1:2 rectangle is dissected into 1:2 rectangular elements of different ...
International audienceWe extend the notion of canonical orderings to cylindric triangulations. This ...
The chromatic number of a graph G is the least number of colours that can be assigned to the vertic...
International audienceWe extend the notion of canonical ordering, initially developed for planar tri...
37 pagesWe extend the notion of canonical ordering (initially developed for planar triangulations an...
AbstractCircular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to ...
We extend the notion of canonical orderings to cylindric triangulations. This allows us to extend th...
A compound perfect squared square must contain at least 22 subsquares. The proof utilizes elementary...
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their de...
The procedure is proposed for obtaining the complexity numbers of square-cell configurations. It is ...
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylin...
DOI
Add to ORKG