✦ LIBER ✦

Subgraph trees in graph theory

✍ Scribed by Terry A. McKee

Book ID: 108315895
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 317 KB
Volume: 270
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00161-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced Subgraph in Random Regular Graph

✍ Lan XIAO; Guiying YAN; Yuwen WU; Wei REN 📂 Article 📅 2008 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 229 KB

On subgraph number independence in trees

✍ R.L Graham; E Szemerédi 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A decision tree approach to graph and su

A decision tree approach to graph and subgraph isomorphism detection

✍ B.T. Messmer; H. Bunke 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 577 KB

Packing subgraphs in a graph

✍ G. Cornuéjols; D. Hartvigsen; W. Pulleyblank 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Finite Induced Graph Ramsey Theory: On P

Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs

✍ D.S. Gunderson; V. Rodl; N.W. Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 425 KB

For given finite (unordered) graphs \(G\) and \(H\), we examine the existence of a Ramsey graph \(F\) for which the strong Ramsey arrow \(F \rightarrow(G)_{r}^{\prime \prime}\) holds. We concentrate on the situation when \(H\) is not a complete graph. The set of graphs \(G\) for which there exists a

Fixed point theorems in -trees with appl

Fixed point theorems in -trees with applications to graph theory

✍ R. Espínola; W.A. Kirk 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 101 KB