A note on kernel-critical graphs
From MaRDI portal
Publication:1150376
DOI10.1016/0012-365X(81)90264-8zbMath0456.05032MaRDI QIDQ1150376
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (26)
On kernel-perfect critical digraphs ⋮ A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs ⋮ Enumerating the kernels of a directed graph with no odd circuits ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory ⋮ Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ Recent problems and results about kernels in directed graphs ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ Alternating kernels ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ Perfect graphs, kernels, and cores of cooperative games ⋮ Kernels and perfectness in arc-local tournament digraphs ⋮ A counterexample to a conjecture of Meyniel on kernel-perfect graphs ⋮ Kernels in pretransitive digraphs. ⋮ Extending kernel perfect digraphs to kernel perfect critical digraphs ⋮ A Richardson's theorem version for \(\Pi\)-kernels ⋮ A new generalization of kernels in digraphs ⋮ On a class of kernel-perfect and kernel-perfect-critical graphs ⋮ Kernels in quasi-transitive digraphs ⋮ Kernels and some operations in edge-coloured digraphs ⋮ Some sufficient conditions for the existence of kernels in infinite digraphs ⋮ On kernels and semikernels of digraphs ⋮ Miscellaneous Digraph Classes ⋮ Normal fraternally orientable graphs satisfy the strong perfect graph conjecture ⋮ Orientations of graphs in kernel theory
Cites Work
This page was built for publication: A note on kernel-critical graphs
