✦ LIBER ✦

Covering hypercubes by isometric paths

✍ Scribed by Shannon L. Fitzpatrick; Richard J. Nowakowski; Derek Holton; Ian Caines

Book ID: 108315666
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 91 KB
Volume: 240
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00197-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric vertex partitions of hypercube

Symmetric vertex partitions of hypercubes by isometric trees

✍ Mark Ramras 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 557 KB

On Vertex Partitions of Hypercubes by Is

On Vertex Partitions of Hypercubes by Isometric Trees

✍ Mollard, Michel 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 106 KB

Paired many-to-many disjoint path covers

Paired many-to-many disjoint path covers of the hypercubes

✍ Chen, Xie-Bin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Paired many-to-many disjoint path covers

Paired many-to-many disjoint path covers of hypercubes with faulty edges

✍ Xie-Bin Chen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Many-to-many two-disjoint path covers in

Many-to-many two-disjoint path covers in restricted hypercube-like graphs

✍ Kim, Sook-Yeon; Park, Jung-Heum 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 727 KB

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.