Acyclic kernel number of oriented cycle related graphs
From MaRDI portal
Recommendations
Cited in
(7)- On the complexity of the 3-kernel problem in some classes of digraphs
- Strong kernel number in certain oriented cycle extension of graphs
- Strong kernel in certain oriented networks
- Acyclic kernel number of biregular graphs
- A note on the kernel number
- Kernel in Oriented Circulant Graphs
- Counting kernels in directed graphs with arbitrary orientations
This page was built for publication: Acyclic kernel number of oriented cycle related graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166160)