𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique divergent clockwork graphs and partial orders

✍ Scribed by F Larrión; V Neumann-Lara; M.A Pizaña

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
259 KB
Volume
141
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

S.

📜 SIMILAR VOLUMES

Graph relations, clique divergence and s
Graph relations, clique divergence and surface triangulations
✍ F. Larrión; V. Neumann-Lara; M.A. Pizaña 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract This work has two aims: first, we introduce a powerful technique for proving clique divergence when the graph satisfies a certain symmetry condition. Second, we prove that each closed surface admits a clique divergent triangulation. By definition, a graph is clique divergent if the orde

Comparability graphs with constraint, pa
Comparability graphs with constraint, partial semi-orders and interval orders
✍ Claude Flament 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 580 KB

A symmetric, anfireflexive relation S is a comparability graph ff one can assign a transitive orientation to the edges: we obtain a partial order. We say that S is a comparability graph with constraint C, a subrelation of S, if S has a transitive orientation including C. A characterization is given

Cut-sets in infinite graphs and partial
Cut-sets in infinite graphs and partial orders
✍ A. Hajnal; N. Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Hajnal, A. and N. Sauer, Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117 (1993) 113-125. The set S c V(U) is a cut-set of the vertex v of a graph 9 if v is not adjacent to any vertex in S and, for every maximal clique C of Q, ({v} u S) n C # 0. S is a cut-set of the element