✦ LIBER ✦

Maximum lower bound on embedding areas of general graphs

✍ Scribed by Koichi Wada; Kimio Kawaguchi; Hideyuki Fujishima

Book ID: 112205900
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 932 KB
Volume: 20
Category: Article
ISSN: 0882-1666
DOI: 10.1002/scj.4690201004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On embedding graphs with bounded sum of

On embedding graphs with bounded sum of size and maximum degree

✍ Żak, Andrzej 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Improved lower bounds for embedding hype

Improved lower bounds for embedding hypercubes on de Bruijn graphs

✍ Stefka Fidanova; Denis R. Trystram 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 208 KB

General lower bound on the size of\((H;k

General lower bound on the size of\((H;k)\)-stable graphs

✍ Żak, Andrzej 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 152 KB

Lower Bounds on the Distortion of Embedd

Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

✍ Y. Rabinovich; R. Raz 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 176 KB

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a simplicial graph

✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of 3-edge connected loopless graphs

✍ Li Deming; Liu Yanpei 📂 Article 📅 1999 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 877 KB