On spanning galaxies in digraphs
From MaRDI portal
Recommendations
- Spanning galaxies in digraphs
- Bounds on directed star arboricity in some digraph classes
- Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Directed star decompositions of the complete directed graph
Cites work
- scientific article; zbMATH DE number 3437188 (Why is no real title available?)
- A special planar satisfiability problem and a consequence of its NP- completeness
- Digraphs
- Even cycles in directed graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- On incidence coloring and star arboricity of graphs
- Permanents, Pfaffian orientations, and even directed circuits
- Pólya's permanent problem
- The star arboricity of graphs
- WDM and directed star arboricity
Cited in
(6)- Complexity results on the decomposition of a digraph into directed linear forests and out-stars
- Galaxy cutsets in graphs
- Finding good 2-partitions of digraphs. II. Enumerable properties
- Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties
- Bounds on directed star arboricity in some digraph classes
- Spanning galaxies in digraphs
This page was built for publication: On spanning galaxies in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q415275)
