Displaying similar documents to “Some properties of ordered hypergraphs.”

Strong Chromatic Index Of Planar Graphs With Large Girth

Gerard Jennhwa Chang, Mickael Montassier, Arnaud Pêche, André Raspaud (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [6] when Δ ≥ 6.

Complemented ordered sets

Ivan Chajda (1992)

Archivum Mathematicum

Similarity:

We introduce the concept of complementary elements in ordered sets. If an ordered set S is a lattice, this concept coincides with that for lattices. The connections between distributivity and the uniqueness of complements are shown and it is also shown that modular complemented ordered sets represents “geometries” which are more general than projective planes.