Arc‐disjoint strong spanning subdigraphs of semicomplete compositions

DOI10.1002/jgt.22568zbMath1486.05239arXiv1903.12225OpenAlexW3016551005MaRDI QIDQ5066922

Gregory Gutin, Anders Yeo, Jörgen Bang-Jensen

Publication date: 31 March 2022

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

semicomplete 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)

Related Items (10)

The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings ⋮ Semicomplete compositions of digraphs ⋮ Properly colored cycles of different lengths in edge-colored complete graphs ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Packing strong subgraph in digraphs ⋮ Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs ⋮ Strong subgraph connectivity of digraphs ⋮ Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs ⋮ Smallest number of vertices in a 2-arc-strong digraph without good pairs ⋮ Non-separating spanning trees and out-branchings in digraphs of independence number 2

This page was built for publication: Arc‐disjoint strong spanning subdigraphs of semicomplete compositions