Embedding digraphs of small size

DOI10.1016/S0012-365X(96)00209-9MaRDI QIDQ1356787zbMATH OpenOpenAlexFDO

Authors Irmina A. Zioło, Adam Paweł Wojda

Publication date 16 March 1998

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(96)00209-9

zbMATH Keywords

digraphcomplementing permutationembeddabledisjoint placement

Mathematics Subject Classification ID

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

Recommendations

• Embedding graphs of small size
• Fixed-point-free embeddings of digraphs with small size
• Embedding arbitrary finite simple graphs into small strongly regular graphs
• scientific article; zbMATH DE number 2186718
• On embedding of graphs into Euclidean spaces of small dimension
• Digraph embedding
• Up-embeddability of graphs with small order
• Enumeration of digraph embeddings
• scientific article; zbMATH DE number 426373
• scientific article; zbMATH DE number 1769334

Cites work

• scientific article; zbMATH DE number 3650564 (Why is no real title available?)
• Edge disjoint placement of graphs
• Embedding (p,p - 1) graphs in their complements
• Embedding graphs in their complements
• Embedding graphs of small size
• Every (p,p-2) graph is contained in its complement
• On self‐complementation
• Packing of graphs - a survey
• Packings of graphs and applications to computational complexity

Cited in

(7)

• Immersing small complete graphs
• Mutual placement of a kind of digraph
• Embedding spanning subgraphs of small bandwidth
• Fixed-point-free embeddings of digraphs with small size
• Embedding on alphabet overlap digraphs
• scientific article; zbMATH DE number 2186718 (Why is no real title available?)
• Embedding graphs of small size

This page was built for publication: Embedding digraphs of small size

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