On depth first search trees in \(m\)-out digraphs

DOI10.1007/BF01303205zbMath0778.05037MaRDI QIDQ684408

W. C. Stephen Suen

Publication date: 15 September 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

treesrandom digraphsdepth first searchDFS tree\(m\)-out digraphs

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On the largest strong components in \(m\)-out digraphs ⋮ On large induced trees and long induced paths in sparse random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On large matchings and cycles in sparse random graphs
• The longest path in a random graph
• On the largest strong components in \(m\)-out digraphs
• On large induced trees and long induced paths in sparse random graphs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On depth first search trees in \(m\)-out digraphs