𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs and structures

✍ Scribed by A. Kaveh

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
867 KB
Volume
40
Category
Article
ISSN
0045-7949

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Preference Structures and Co-comparabili
Preference Structures and Co-comparability Graphs
✍ Moncef Abbas; Marc Pirlot; Philippe Vincke πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 850 KB

Order structures such as linear orders, weak orders, semiorders and interval orders are often considered as models of a decision maker's preferences. In this paper we introduce and study new order structures characterized by their symmetric part belonging to certain classes of co-comparability graph

Orthogonal Structures in Directed Graphs
Orthogonal Structures in Directed Graphs
✍ S. Felsner πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 472 KB

Using the minimal cost flow algorithm of Ford and Fulkerson and the notion of orthogonality between chain and antichain families AndrΓ‘s Frank could give common access (and proof) to some famous results in the theory of finite posets:

Core-like properties of infinite graphs
Core-like properties of infinite graphs and structures
✍ B. Bauslaugh πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 554 KB

We define several properties of infinite graphs (structures) which are analogous to the property of being a core in a finite graph. We describe completely the relationships between these properties. We also show which of these properties are invariant under homomorphic equivalence.

Coverings of complete bipartite graphs a
Coverings of complete bipartite graphs and associated structures
✍ John Shawe-Taylor πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 648 KB

A construction is given of distance-regular q-fold covering graphs of the complete bipartite graph K qk,,pk, where q is the power of a prime number and k is any positive integer. Relations with associated distance-biregular graphs are also considered, resulting in the construction of a family of dis

Hereditary properties of combinatorial s
Hereditary properties of combinatorial structures: Posets and oriented graphs
✍ JΓ³zsef Balogh; BΓ©la BollobΓ‘s; Robert Morris πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 247 KB πŸ‘ 1 views

## Abstract A hereditary property of combinatorial structures is a collection of structures (e.g., graphs, posets) which is closed under isomorphism, closed under taking induced substructures (e.g., induced subgraphs), and contains arbitrarily large structures. Given a property $\cal {P}$, we write