✦ LIBER ✦

Proper connection of graphs

✍ Scribed by Valentin Borozan; Shinya Fujita; Aydin Gerek; Colton Magnant; Yannis Manoussakis; Leandro Montero; Zsolt Tuza

Book ID: 113567438
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 271 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.09.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A relationship between triangulated grap

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs

✍ Dale J. Skrien 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

Paramodulated connection graphs

✍ Jörg Siekmann; Graham Wrightson 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 956 KB

Proper Homotopy Classification of Graphs

✍ Ayala, R.; Dominguez, E.; Marquez, A.; Quintero, A. 📂 Article 📅 1990 🏛 Oxford University Press 🌐 English ⚖ 125 KB

Minimum proper interval graphs

✍ M. Gutierrez; L. Oubiña 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 546 KB

A graph G is a proper interval graph if there exists a mapping r from V(G) to the class of closed intervals of the real line with the properties that for distinct vertices u and w we have r(u) n r(w) # 0 if and only if u and w are adjacent and neither of the intervals r(u), r(w) contain the other. W

Lexicographic orientation and representa

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

✍ Pavon Hell; Jing Huang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 823 KB

## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent

The Connectivities of Leaf Graphs of 2-C

The Connectivities of Leaf Graphs of 2-Connected Graphs

✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.