Pages that link to "Item:Q3826584"
From MaRDI portal
The following pages link to Common root functions of two digraphs (Q3826584):
Displaying 7 items.
- An algorithm for optimum common root functions of two digraphs (Q688253) (← links)
- A rooted-forest partition with uniform vertex demand (Q695323) (← links)
- Restricted covering of digraphs with arborescences (Q913812) (← links)
- Arc-disjoint in-trees in directed graphs (Q987553) (← links)
- Disjoint paths in arborescences (Q1773369) (← links)
- Enlarging vertex-flames in countable digraphs (Q1984520) (← links)
- A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof (Q4678083) (← links)