H-Kernels by Walks

Let D = ( V , E ) and H = ( U , F ) be digraphs and consider a colouring of the arcs of D with the vertices of H ; we say that D is H coloured. We study a natural generalisation of the notion of kernel, as introduced by V. Neumann and Morgenstern (1944), to prove that If every cycle of D is an H -cy...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2022, Vol.38 (3), Article 94
Hauptverfasser:	Galeana-Sánchez, Hortensia, Rincon-Galeana, Hugo, Strausz, Ricardo
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Coloring Combinatorics Engineering Design Graph theory Kernels Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!