Packing of two digraphs into a transitive tournament

DOI10.1016/J.DISC.2005.11.038zbMath1113.05041OpenAlexW2153628540MaRDI QIDQ868371

Monika Pilśniak

Publication date: 2 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.038

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A note on an embedding problem in transitive tournaments

Cites Work

• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Packing of graphs - a survey
• Every (p,p-2) graph is contained in its complement
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing of two digraphs into a transitive tournament