𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Randomly Traceable Graphs

✍ Scribed by Chartrand, Gary; Kronk, Hudson V.

Book ID
118192454
Publisher
Society for Industrial and Applied Mathematics
Year
1968
Tongue
English
Weight
535 KB
Volume
16
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Randomly Near-Traceable Graphs
Randomly Near-Traceable Graphs
✍ Fink, John Frederick πŸ“‚ Article πŸ“… 1985 πŸ› Society for Industrial and Applied Mathematics βš– 769 KB
Traceability of -traceable oriented grap
Traceability of -traceable oriented graphs
✍ Susan A. van Aardt; Jean E. Dunbar; Marietjie Frick; Peter Katrenič; Morten H. N πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 588 KB
Traceability of line graphs
Traceability of line graphs
✍ Liming Xiong; Minmin Zong πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 632 KB
Reverse mathematics and infinite traceab
Reverse mathematics and infinite traceable graphs
✍ Peter Cholak; David Galvin; Reed Solomon πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract We analyze three applications of Ramsey’s Theorem for 4‐tuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramsey’s Theorem while the application in lattice t

Randomly planar graphs
Randomly planar graphs
✍ Daniel C. Isaksen; David P. Moulton πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 189 KB

A graph G is randomly planar if every planar embedding of every connected subgraph of G can be extended to a planar embedding of G. We classify these graphs. ## 1. Introduction Many properties of graphs have been 'randomized' by various mathematicians. Examples include the notions of randomly eule