✦ LIBER ✦

Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes

✍ Scribed by Marco Buratti

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 244 KB
Volume: 161
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00235-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance monotone graphs and a new chara

Distance monotone graphs and a new characterization of hypercubes

✍ Gustav Burosch; Ivan Havel; Jean-Marie Laborde 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB

Burosch, G., I. Have1 and J.-M. Laborde, Distance monotone graphs and a new characterization of hypercubes, Discrete Mathematics 110 (1992) 9-16.

A new characterization of median graphs

✍ Abdelhafid Berrachedi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A graph is Hilbertian if for any three vertices u, v and w, the interval I(u, u) contains a unique nearest vertex p from w. We show that a graph is median if and only if it is Hilbertian.

A new characterization of proper interva

A new characterization of proper interval graphs

✍ Zygmunt Jackowski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 379 KB

One of the first characterizations of interval graphs, given by Lekkerkerker and Boland (1962), uses the concept of an asteroidal triple. In this paper we give a similar characterization on the proper interval graphs using the akin concept of an astral triple.

Synthesis and Characterization of a New

Synthesis and Characterization of a New Class of Benzothiazolines.

✍ D.. Shanker; R. K. Sharma; J. Sharma; A. K. Rai; Y. P. Singh 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 13 KB 👁 2 views

A Characterization of Some Graph Classes

A Characterization of Some Graph Classes with No Long Holes

✍ E. Eschen; R. Sritharan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We give a characterization of a hierarchy of graph classes with no long holes in which each class excludes some long antiholes. At one end of the hierarchy is the class of graphs with no long holes. At the other end is the class of weakly triangulated graphs. The characterization has the flavor of t

Characterization of a class of triangle-

Characterization of a class of triangle-free graphs with a certain adjacency property

✍ Brian Alspach; C. C. Chen; Katherine Heinrich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 597 KB

## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangle‐free graphs __G__ such that for any independent __m__‐subset __M__ and any __n__‐subset __N__ of __V__(__G__) with __M__ ∩ __N__ = Ø, there exists a unique vertex of __G__ that is adjacent to e