𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reverse mathematics and rank functions for directed graphs

✍ Scribed by Jeffry L. Hirst

Publisher
Springer
Year
2000
Tongue
English
Weight
95 KB
Volume
39
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Reverse Mathematics and Grundy colorings
Reverse Mathematics and Grundy colorings of graphs
✍ James H. Schmerl πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 137 KB

The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.

Reverse Mathematics and Recursive Graph
Reverse Mathematics and Recursive Graph Theory
✍ William Gasarch; Jeffry L. Hirst πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 511 KB

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths.

The Isomorphism Problem For Directed Pat
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
✍ L. Babel; I.N. Ponomarenko; G. Tinhofer πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 237 KB

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path