On digraphs with a rooted tree structure

DOI10.1002/NET.3230150106MaRDI QIDQ3705478zbMATH OpenOpenAlexFDO

Authors Jayme L. Szwarcfiter

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11422/1515

zbMATH Keywords

depth first searchisomorphismrooted treeTR digraphtransitive reductiontree reducible digraph

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 36200
• An algorithm for transitive reduction of an acyclic graph
• Solving problems for maximal reducible flowgraphs.
• scientific article; zbMATH DE number 475590
• scientific article; zbMATH DE number 165071

Cites work

• scientific article; zbMATH DE number 3679848 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3388535 (Why is no real title available?)
• Testing flow graph reducibility

Cited in

(5)

• Solving problems for maximal reducible flowgraphs.
• Rooted induced trees in triangle-free graphs
• scientific article; zbMATH DE number 36200 (Why is no real title available?)
• scientific article; zbMATH DE number 165071 (Why is no real title available?)
• T-irreducible extensions of directed starlike trees

This page was built for publication: On digraphs with a rooted tree structure

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