EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 2 of 2

Weak edge-degree domination in hypergraphs

Belmannu Devadas Acharya, Purnima Gupta (2006)

Czechoslovak Mathematical Journal

In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a given hypergraph.

When is an Incomplete 3 × n Latin Rectangle Completable?

Reinhardt Euler, Paweł Oleksik (2013)

Discussiones Mathematicae Graph Theory

We use the concept of an availability matrix, introduced in Euler [7], to describe the family of all minimal incomplete 3 × n latin rectangles that are not completable. We also present a complete description of minimal incomplete such latin squares of order 4.

Currently displaying 1 – 2 of 2

Page 1