✦ LIBER ✦

A characterization of n-component graphs

✍ Scribed by Claude A. Christen; Giovanni Coray; Stanley M. Selkow

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 130 KB
Volume: 149
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00246-s

No coin nor oath required. For personal study only.

✦ Synopsis

The n-component graph of a graph G is the intersection graph having a point corresponding to each n-component of G and a line joining two points whenever the corresponding n-components of G share at least one point. We give a characterization of graphs which are n-component graphs of some graph, thus generalizing a theorem of .

📜 SIMILAR VOLUMES

A characterization of absolute retracts

A characterization of absolute retracts of n-chromatic graphs

✍ Erwin Pesch; Werner Poguntke 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A recursive characterization of the absolute retracts in the class of n-chromatic (connected) graphs is given.

A characterization of Seymour graphs

✍ Ageev, A. A.; Kostochka, A. V.; Szigeti, Z. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

A connected undirected graph G is called a Seymour graph if the maximum number of edge disjoint T -cuts is equal to the cardinality of a minimum T -join for every even subset T of V (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour

A characterization of ptolemaic graphs

✍ Edward Howorka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 466 KB

A connected graph G is ptolernaic provided that for each four vertices u,, 1 5 i 5 4, of G, the six distances d, =dG (u,ui), i f j satisfy the inequality d,2d34 5 d,3d24 + d,4d23 (shown by Ptolemy t o hold in Euclidean spaces). Ptolemaic graphs were first investigated by Chartrand and Kay, who showe

A characterization of ?-outerplanar grap

A characterization of ?-outerplanar graphs

✍ Wargo, Lawrence 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

Chartrand and Harary have shown that if G is a non-outerplanar graph such that, for every edge e, both the deletion G \ e and the contraction G/e of e from G are outerplanar, then G is isomorphic to K4 or K2,3. An a-outerplanar graph is a graph which is not outerplanar such that, for some edge a , b

Counting k-component forests of a graph

✍ Wendy Myrvold 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB

A characterization of radius-critical gr

A characterization of radius-critical graphs

✍ Siemion Fajtlowicz 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

A graph G is radius-critical if every proper induced connected subgraph of G has radius strictly smaller than the original graph. Our main purpose is to characterize all such graphs. 1. By a graph we shall mean here a finite, simple, undirected graph. For a connected graph the distance between two