On Packable Digraphs

DOI10.1137/090748056zbMath1213.05114OpenAlexW2059370524MaRDI QIDQ5392909

Andrzej Żak, Agnieszka Goerlich

Publication date: 15 April 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/53bf24a6e6346d9cc58888a688acd10af5ec676c

zbMATH Keywords

packingdirected graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Sparse graphs of girth at least five are packable ⋮ On embedding graphs with bounded sum of size and maximum degree

This page was built for publication: On Packable Digraphs