The kernel in special directed circular graphs
From MaRDI portal
Recommendations
Cited in
(13)- A note on Duchet's conjecture
- Enumerating the kernels of a directed graph with no odd circuits
- A circular graph---counterexample to the Duchet kernel conjecture
- A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs
- The geometric kernel of integral circulant graphs
- Strong kernel number in certain oriented cycle extension of graphs
- Total-kernel in oriented circular ladder and Mobius ladder.
- Kernel in Oriented Circulant Graphs
- Kernels in Cartesian products of digraphs
- Kernels in circulant digraphs
- Kernels in tensor product of digraphs. II.
- Kernel in cycle related graphs
- Counting kernels in directed graphs with arbitrary orientations
This page was built for publication: The kernel in special directed circular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5198203)