✦ LIBER ✦

Representing edge intersection graphs of paths on degree 4 trees

✍ Scribed by Martin Charles Golumbic; Marina Lipshteyn; Michal Stern

Book ID: 108113867
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 178 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.07.064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge intersection graphs of paths in

The edge intersection graphs of paths in a tree

✍ Martin Charles Golumbic; Robert E Jamison 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 791 KB

Triangulated edge intersection graphs of

Triangulated edge intersection graphs of paths in a tree

✍ Maciej M. Sysło 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Edge intersection graphs of single bend

Edge intersection graphs of single bend paths on a grid

✍ Martin Charles Golumbic; Marina Lipshteyn; Michal Stern 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

Recognition algorithm for intersection g

Recognition algorithm for intersection graphs of edge disjoint paths in a tree

✍ B.S. Panda; S.P. Mohanty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Some properties of edge intersection gra

Some properties of edge intersection graphs of single-bend paths on a grid

✍ A. Asinowski; B. Ries 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 515 KB

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.