✦ LIBER ✦

On the structure of linear graphs

✍ Scribed by P. Erdös

Book ID: 112884954
Publisher: The Hebrew University Magnes Press
Year: 1963
Tongue: English
Weight: 231 KB
Volume: 1
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02759702

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the structure of linear apex NLC grap

On the structure of linear apex NLC graph grammars

✍ Changwook Kim 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 213 KB

On the Solution of a Locally Finite Syst

On the Solution of a Locally Finite System of Linear Inequalities with Graph Structure

✍ V. V. Ostapenko; G. S. Finin 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 62 KB

Impact of the actuator failures on the s

Impact of the actuator failures on the structural controllability of linear systems: A graph theoretical approach

✍ Maza, S.; Simon, C.; Boukhobza, T. 📂 Article 📅 2012 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 569 KB

On linear and circular structure of (cla

On linear and circular structure of (claw, net)-free graphs

✍ Andreas Brandstädt; Feodor F. Dragan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 289 KB

We prove that every (claw, net)-free graph contains an induced doubly dominating cycle or a dominating pair. Moreover, using LexBFS we present a linear time algorithm which, for a given (claw, net)-free graph, ÿnds either a dominating pair or an induced doubly dominating cycle. We show also how one

Structured sparse linear graph embedding

✍ Haixian Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 668 KB

On the linear arboricity of planar graph

On the linear arboricity of planar graphs

✍ Wu, Jian-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree ∆. The conjecture has been proved to be true for graphs having ∆ =