✦ LIBER ✦

On Ks,t minors in (s+t)-chromatic graphs

✍ Scribed by A. V. Kostochka

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 99 KB
Volume: 65
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20485

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Differences in performance on the chroma

Differences in performance on the chromatic Vs. Achromatic H-T-P drawings

✍ Vytautas J. Bieliauskas; Ann R. Heffron 📂 Article 📅 1960 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

Edge-Disjoint (s, t)-Paths in Undir

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time

✍ Karsten Weihe 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 279 KB

We consider the following problem. Let G s V, E be an undirected planar graph and let s, t g V, s / t. The problem is to find a set of pairwise edge-disjoint paths in G, each connecting s with t, of maximum cardinality. In other words, the problem is to find a maximum unit flow from s to t. The fast

On minimum degree in Hamiltonian path gr

On minimum degree in Hamiltonian path graphs

✍ George R. T. Hendry 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

On mean distance in certain classes of g

On mean distance in certain classes of graphs

✍ George R. T. Hendry 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB 👁 1 views

On certain Hamiltonian cycles in planar

On certain Hamiltonian cycles in planar graphs

✍ B�hme, T.; Harant, J.; Tk�?, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

Total domination in graphs

✍ E. J. Cockayne; R. M. Dawes; S. T. Hedetniemi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB