Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs

DOI10.1016/j.disc.2019.05.003zbMath1418.05069arXiv1812.08809OpenAlexW2964336108WikidataQ127815690 ScholiaQ127815690MaRDI QIDQ2319713

Yanyan Li

Publication date: 20 August 2019

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

Full work available at URL: https://arxiv.org/abs/1812.08809

zbMATH Keywords

Cartesian productstrong productsemicomplete digraphdecomposition into strong spanning subdigraphsstrong spanning subdigraphdigraph composition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs, Semicomplete compositions of digraphs, Packing strong subgraph in digraphs, Strong subgraph connectivity of digraphs, Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
• Hamiltonian decomposition of lexicographic products of digraphs
• Basic Terminology, Notation and Results
• Quasi-Transitive Digraphs and Their Extensions
• When the cartesian product of directed cycles is Hamiltonian
• Quasi‐transitive digraphs
• Digraphs