On packable digraphs

DOI10.1137/090748056MaRDI QIDQ5392909zbMATH OpenOpenAlexFDO

Authors Agnieszka Görlich, Andrzej Żak

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

directed graphspacking

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3968612
• Packing two graphs of order n having total size at most 2n-2
• Two theorems on packings of graphs
• Toward Wojda's conjecture on digraph packing
• Packing of two digraphs into a transitive tournament

Cited in

(9)

• On the complexity of digraph packings
• Sparse graphs of girth at least five are packable
• Cycle packings in graphs and digraphs
• On embedding graphs with bounded sum of size and maximum degree
• Between packable and arbitrarily packable graphs: Packer-spoiler games
• scientific article; zbMATH DE number 3968612 (Why is no real title available?)
• scientific article; zbMATH DE number 4127236 (Why is no real title available?)
• Packing Digraphs with Directed Closed Trails
• Packing of two digraphs into a transitive tournament

This page was built for publication: On packable digraphs

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