scientific article; zbMATH DE number 1187507

MaRDI QIDQ3840692zbMATH OpenFDO

Authors Peter Clote, Jeffry L. Hirst

Publication date 7 March 1999

Full work available at URL https://eudml.org/doc/212275

zbMATH Keywords

spanning treesgraph theoryreverse mathematicstopological sortingreachability matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph theory (including graph drawing) in computer science (68R10) Theory of numerations, effectively presented structures (03D45) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Reverse Mathematics and Recursive Graph Theory
• Reverse mathematics and the coloring number of graphs
• Connected components of graphs and reverse mathematics
• Reverse mathematics and Grundy colorings of graphs
• Reverse mathematics and rank functions for directed graphs
• Reverse mathematics and colorings of hypergraphs
• Reverse mathematics and infinite traceable graphs
• Reverse mathematics of matroids
• Generalized inverses in graph theory

Cited in

(4)

• Reverse Mathematics and Recursive Graph Theory
• Reverse mathematics and rank functions for directed graphs
• On the existence of a connected component of a graph
• Reverse mathematics and colorings of hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840692)