Universal third parts of any complete 2-graph and none of DK₅

DOI10.7494/OPMATH.2013.33.4.685MaRDI QIDQ2864643zbMATH OpenOpenAlexFDO

Authors Artur Fortuna, Zdzisław Skupień

Publication date 26 November 2013

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/opmath.2013.33.4.685

zbMATH Keywords

decompositionremainderisomorphic partsuniversal parts

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On some third parts of nearly complete digraphs
• \(\widehat K_{p,q}\)-factorization of symmetric complete tripartite digraphs
• Self-converse and oriented graphs among the third parts of nearly complete digraphs
• Decompositions of complete digraphs into small tripartite digraphs
• Decompositions, packings and coverings of the complete digraph with orientations of \(K_3 \cup \{e\}\)

Cited in

(1)

• On some third parts of nearly complete digraphs

This page was built for publication: Universal third parts of any complete 2-graph and none of \(DK_{5}\)

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