Strong kernel in certain oriented networks

MaRDI QIDQ3452029zbMATH OpenFDO

Authors Joice Punitha

Publication date 18 November 2015

zbMATH Keywords

planar digraphstrong kernel problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 6096690
• Kernel in Oriented Circulant Graphs
• Strong kernel number in certain oriented cycle extension of graphs
• Acyclic kernel number of oriented cycle related graphs
• scientific article; zbMATH DE number 6194066

Cited in

(9)

• On the complexity of the 3-kernel problem in some classes of digraphs
• Kernels in planar digraphs
• Strong kernel number in certain oriented cycle extension of graphs
• Total-kernel in oriented circular ladder and Mobius ladder.
• Acyclic kernel number of oriented cycle related graphs
• Acyclic kernel number of biregular graphs
• Finding kernels or solving SAT
• Inductive kernels of graphs
• Polynomial algorithms for kernels in comparability, permutation and P₄-free graphs

This page was built for publication: Strong kernel in certain oriented networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452029)