Publication:868371

DOI10.1016/J.DISC.2005.11.038zbMATH Open1113.05041OpenAlexW2153628540MaRDI QIDQ868371FDOQ868371

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Packings of graphs and applications to computational complexity
• Edge disjoint placement of graphs
• Packing of graphs - a survey
• Every (p,p-2) graph is contained in its complement

Cited In (3)

• A note on an embedding problem in transitive tournaments
• Packing transitive triples in a tournament
• \(\text{TT}_n\)-maximal digraphs of the minimum size

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

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