✦ LIBER ✦

Cycle-free partial orders and chordal comparability graphs

✍ Scribed by Tze-Heng Ma; Jeremy P. Spinrad

Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 730 KB
Volume: 8
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00385814

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

LexBFS-orderings and powers of chordal g

LexBFS-orderings and powers of chordal graphs

✍ Andreas Brandstädt; Feodor F. Dragan; Falk Nicolai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 824 KB

For an undirected graph G the kth power G k of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G. In this paper we prove that any LexBFS-ordering of a chordal graph is a common perfect elimination ordering of all odd powers of this grap

Clique divergent clockwork graphs and pa

Clique divergent clockwork graphs and partial orders

✍ F Larrión; V Neumann-Lara; M.A Pizaña 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Graphs and partial orderings

✍ Martin Aigner 📂 Article 📅 1969 🏛 Springer Vienna 🌐 English ⚖ 595 KB

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

Generating and characterizing the perfec

Generating and characterizing the perfect elimination orderings of a chordal graph

✍ L.S. Chandran; L. Ibarra; F. Ruskey; J. Sawada 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 402 KB

We develop a constant time transposition "oracle" for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the