𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Triangulated edge intersection graphs of paths in a tree

✍ Scribed by Maciej M. Sysło

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
268 KB
Volume
55
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering the Edges of a Connected Graph
Covering the Edges of a Connected Graph by Paths
✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

Cycles and paths in edge-colored graphs
Cycles and paths in edge-colored graphs with given degrees
✍ A. Abouelaoualim,; K. Ch. Das; W. Fernandez de la Vega; M. Karpinski; Y. Manouss 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

## Abstract Sufficient degree conditions for the existence of properly edge‐colored cycles and paths in edge‐colored graphs, multigraphs and random graphs are investigated. In particular, we prove that an edge‐colored multigraph of order __n__ on at least three colors and with minimum colored degre

On the intersection of edges of a geomet
On the intersection of edges of a geometric graph by straight lines
✍ N. Alon; M.A. Perles 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0