Disjoint paths in arborescences (Q1773369)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Disjoint paths in arborescences	scientific article

Statements

scholarly article

0 references

Disjoint paths in arborescences (English)

0 references

0 references

Michele Conforti

0 references

Giacomo Zambelli

0 references

Discrete Mathematics

0 references

publication date

28 April 2005

0 references

zbMATH Keywords

Disjoint spanning arborescences

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.disc.2004.12.005

0 references

0 references

A matroid approach to finding edge connectivity and packing arborescences

0 references

Independent trees in graphs

0 references

Disproof of a conjecture about independent branchings in <i>k</i>‐connected directed graphs

0 references

The multi-tree approach to reliability in distributed networks

0 references

Vertex-disjoint paths and edge-disjoint branchings in directed graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.disc.2004.12.005

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1773369

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1773369&oldid=34394910"