On kernel-perfect orientations of line graphs
نویسندگان
چکیده
We exploit the technique of Galvin (1995) to prove that an orientation D of a line-graph G (of a multigraph) is kernel-perfect if and only if every oriented odd cycle in D has a chord (or pseudochord) and every clique has a kernel. @ 1998 Elsevier Science B.V. All rights reserved
منابع مشابه
Parity graphs are kernel-M-solvable
While the famous Berge’s Strong Perfect Graph Conjecture (see [l] for details on perfect graphs) remains a major unsolved problem in Graph Theory, an alternative characterization of Perfect Graphs was conjectured in 1982 by Berge and the author [3]. This second conjecture asserts the existence of kernels for a certain type of orientations of perfect graphs. Here we prove a weaker form of the co...
متن کاملOn Kernel Mengerian Orientations of Line Multigraphs
We present a polyhedral description of kernels in orientations of line multigraphs. Given a digraph D, let FK(D) denote the fractional kernel polytope defined on D, and let σ(D) denote the linear system defining FK(D). A digraph D is called kernel perfect if every induced subdigraph D has a kernel, called kernel ideal if FK(D) is integral for each induced subdigraph D, and called kernel Mengeri...
متن کاملPerfect graphs are kernel solvable
In this paper we prove that perfect graphs are kernel solvable, as it was conjectured by Berge and Duchet (1983). The converse statement, i.e. that kernel solvable graphs are perfect, was also conjectured in the same paper, and is still open. In this direction we prove that it is always possible to substitute some of the vertices of a non-perfect graph by cliques so that the resulting graph is ...
متن کاملThe list chromatic index of simple graphs whose odd cycles intersect in at most one edge
We study the class of simple graphs G for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in G and prove that every G ∈ G satisfies the list-edge-coloring conjecture. When ∆(G) ≥ 4, we in fact prove a stronger result about kernel-perfect orientations in L(G) which implies that G is (m∆(G) : m)edge-choosable and ∆(G)-edge...
متن کاملPerfect graphs with polynomially computable kernels
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polyn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 191 شماره
صفحات -
تاریخ انتشار 1998