Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Monochromatic kernel-perfectness of special classes of digraphs

Hortensia Galeana-SánchezLuis Alberto Jiménez Ramírez — 2007

Discussiones Mathematicae Graph Theory

In this paper, we introduce the concept of monochromatic kernel-perfect digraph, and we prove the following two results: (1) If D is a digraph without monochromatic directed cycles, then D and each α v , v V ( D ) are monochromatic kernel-perfect digraphs if and only if the composition over D of ( α v ) v V ( D ) is a monochromatic kernel-perfect digraph. (2) D is a monochromatic kernel-perfect digraph if and only if for any B ⊆ V(D), the duplication of D over B, D B , is a monochromatic kernel-perfect digraph.

Page 1

Download Results (CSV)