Common root functions of two digraphs

DOI10.1002/JGT.3190130211MaRDI QIDQ3826584zbMATH OpenOpenAlexFDO

Authors Mao-Cheng Cai

Publication date 1989

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190130211

zbMATH Keywords

arborescencedigraphsroot function

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• An algorithm for optimum common root functions of two digraphs
• Some generalizations of Menger's theorem concerning arc-connected digraphs
• scientific article; zbMATH DE number 4212101
• Restricted covering of digraphs with arborescences
• Disjoint paths in arborescences

Cited in

(8)

• Disjoint paths in arborescences
• Enlarging vertex-flames in countable digraphs
• scientific article; zbMATH DE number 4212101 (Why is no real title available?)
• A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof
• An algorithm for optimum common root functions of two digraphs
• A rooted-forest partition with uniform vertex demand
• Restricted covering of digraphs with arborescences
• Arc-disjoint in-trees in directed graphs

This page was built for publication: Common root functions of two digraphs

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