Fixed-point-free embeddings of digraphs with small size

DOI10.1016/J.DISC.2005.11.070zbMath1116.05023OpenAlexW1987040256MaRDI QIDQ878623

Monika Pilśniak, Irmina A. Zioło, Mariusz Woźniak, Agnieszka Goerlich

Publication date: 26 April 2007

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

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

zbMATH Keywords

packing of digraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A note on an embedding problem in transitive tournaments

Cites Work

• Unnamed Item
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Packings of graphs and applications to computational complexity
• Fixed-point-free embeddings of graphs in their complements
• Embedding graphs of small size
• Embedding digraphs of small size
• On cyclically embeddable \((n,n-1)\)-graphs
• On self‐complementation
• Embedding graphs in their complements
• Every (p,p-2) graph is contained in its complement
• On cyclically embeddable (n,n)-graphs
• On Representatives of Subsets

This page was built for publication: Fixed-point-free embeddings of digraphs with small size