✦ LIBER ✦

Skew chain orders and sets of rectangles

✍ Scribed by Douglas B. West; Daniel J. Kleitman

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 451 KB
Volume: 27
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(79)90073-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Defining sets in vertex colorings of gra

Defining sets in vertex colorings of graphs and latin rectangles

✍ E.S. Mahmoodian; Reza Naserasr; Manouchehr Zaker 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 410 KB

In a given graph G, a set of vertices S with an assignment of colors is said to be a defining set of the vertex coloring of G, if there exists a unique extension of the colors of S to a z(G)coloring of the vertices of G. The concept of a defining set has been studied, to some extent, for block desig

Skew-Hadamard matrices of orders 436, 58

Skew-Hadamard matrices of orders 436, 580, and 988 exist

✍ Dragomir Ž. Đoković 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract We construct two difference families on each of the cyclic groups of order 109, 145, and 247, and use them to construct skew‐Hadamard matrices of orders 436, 580, and 988. Such difference families and matrices are constructed here for the first time. The matrices are constructed by usin

On chain and antichain families of a par

On chain and antichain families of a partially ordered set

✍ András Frank 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Simple Perfect Squared Squares and 2 × 1

Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Orders 21 to 24

✍ A.J.W. Duijvestijn 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 288 KB

In this note tables of all simple perfect squared squares and \(2 \times 1\) squared rectangles of orders \(21,22,23\), and 24 are presented. 1993 Academic Press, Inc.

The orders of graphs with prescribed deg

The orders of graphs with prescribed degree sets

✍ Timothy A. Sipka 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 1 views

## Abstract The degree set 𝒟^G^ of a graph __G__ is the set of degrees of the vertices of __G.__ For a finite nonempty set __S__ of positive integers, all positive integers __p__ are determined for which there exists a graph __G__ of order __p__ such that 𝒟^G^ = __S__.

Colorings of diagrams of interval orders

Colorings of diagrams of interval orders and α-sequences of sets

✍ Stefan Felsner; William T. Trotter 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 383 KB

We show that a proper coloring of the diagram of an interval order I may require 1 + I-log 2 height(l)] colors and that 2 + l-log 2 height(I)'] colors always suffice. For the proof of the upper bound we use the following fact: A sequence C 1 ... ## .. C h of sets (of colors) with the property (ct) C