On spanning galaxies in digraphs
From MaRDI portal
Publication:415275
DOI10.1016/J.DAM.2011.07.013zbMATH Open1241.05043OpenAlexW2033391704MaRDI QIDQ415275FDOQ415275
Authors: Frédéric Havet, Alexandre Pinlou, Daniel Gonçalves, Stéphan Thomassé 
Publication date: 11 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.013
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
- Pólya's permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- Digraphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- A special planar satisfiability problem and a consequence of its NP- completeness
- On incidence coloring and star arboricity of graphs
- The star arboricity of graphs
- Even cycles in directed graphs
- WDM and directed star arboricity
- Title not available (Why is that?)
Cited In (6)
- Galaxy cutsets in graphs
- Complexity results on the decomposition of a digraph into directed linear forests and out-stars
- 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
- Spanning galaxies in digraphs
- Finding good 2-partitions of digraphs. II. Enumerable properties
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)
