On kernel-perfect critical digraphs

@article{GaleanaSnchez1986OnKC,
  title={On kernel-perfect critical digraphs},
  author={Hortensia Galeana-S{\'a}nchez and Victor Neumann-Lara},
  journal={Discrete Mathematics},
  year={1986},
  volume={59},
  pages={257-265}
}
In this paper we investigate new sufficient conditions for a digraph to be kernel-perfect (KP) and some structural properties of kernel-perfect critical (KPC) digraphs. In particular, it is proved that the asymmetrical part of any KPC digraph is strongly connected. A new method to construct KPC digraphs is developed. The existence of KP and KPC digraphs with arbitrarily large dichromatic number is also discussed. 
BETA

Similar Papers

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 28 CITATIONS

A Characterization of Locally Semicomplete CKI-digraphs

  • Graphs and Combinatorics
  • 2016
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Kernels and perfectness in arc-local tournament digraphs

  • Discrete Mathematics
  • 2006
VIEW 3 EXCERPTS
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

On kernels and semikernels of digraphs

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A note on kernel-critical graphs

  • Discrete Mathematics
  • 1981
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Graphes Noyau-Parfaits

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Representation; noyaux en theorie des graphes et hypergraphes

P. Duchet
  • Th6se, Paris
  • 1979
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Semintideos de una digrLfica

V. Neumann-Lara
  • An. Inst. Mat. Univ. Nac. Aut6noma M6xico II
  • 1971
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

On weakly ordered systems

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

The dichromatic number of a digraph

  • J. Comb. Theory, Ser. B
  • 1982
VIEW 2 EXCERPTS

Etude the6rique du Noyau d' un graphe

H. Jacob
  • Th6se, Universit6 Pierre et Marie Curie, Paris VI
  • 1979