✦ LIBER ✦

Graphs and partial orderings

✍ Scribed by Martin Aigner

Publisher: Springer Vienna
Year: 1969
Tongue: English
Weight: 595 KB
Volume: 73
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01316658

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New partial orderings and applications

✍ Enrico Fagiuoli; Franco Pellerey 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

Well-partial orderings and hierarchies

✍ D.H.J de Jongh; Rohit Parikh 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 722 KB

Full and fundamental partial orderings

✍ Ph. Dwinger 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 317 KB

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

On ordered graphs and graph orderings

✍ Jaroslav Nešetřil 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 290 KB

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