✦ LIBER ✦

Ancestors graph and an upper bound for the subword complexity function

✍ Scribed by Guillaume, Delalleau

Book ID: 119375435
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 272 KB
Volume: 468
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.11.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factorial languages with quadratically u

Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities

✍ Gerd Baron; Friedrich Urbanek 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 185 KB

An asymptotic bound for the complexity o

An asymptotic bound for the complexity of monotone graph properties

✍ Torsten Korneffel; Eberhard Triesch 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 171 KB

An upper bound for the complexity of tra

An upper bound for the complexity of transformation semigroups

✍ Stuart W Margolis; Bret Tilson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 759 KB

An Upper Bound for the Excessive Index o

An Upper Bound for the Excessive Index of an r-Graph

✍ Giuseppe Mazzuoccolo 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 599 KB

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

Note: An Upper Bound for the Diameter of

Note: An Upper Bound for the Diameter of a Graph

✍ Merris, Russell 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 140 KB