$H$-kernels in $H$-colored digraphs without $(\xi_{1}, \xi, \xi_{2})$-$H$-subdivisions of $\overrightarrow{C_{3}}$
Felipe Hern\'andez-Lorenzana, Roc\'io S\'anchez-L\'opez

TL;DR
This paper studies conditions under which $H$-colored digraphs possess $H$-kernels, focusing on the structural properties of the color-class digraph and specific subdivisions related to partitions of the color set.
Contribution
It establishes new conditions involving partitions and subdivisions that guarantee the existence of $H$-kernels in $H$-colored digraphs, extending previous understanding.
Findings
Identifies structural properties of the color-class digraph that imply $H$-kernel existence.
Provides conditions on cycles and paths related to partitions $\xi_1$, $\xi_2$.
Shows tightness of hypotheses through examples.
Abstract
Let be a digraph possibly with loops and a digraph without loops with a coloring of its arcs ( is said to be an -colored digraph). A directed path in is said to be an -path if and only if the consecutive colors encountered on form a directed walk in . A subset of vertices of is said to be an -kernel if (1) for every pair of different vertices in there is no -path between them and (2) for every vertex in V() there exists an -path in from to . Under this definition an -kernel is a kernel whenever . The color-class digraph () of is the digraph whose vertices are the colors represented in the arcs of and (,) (()) if and only if there exist two arcs, namely (,) and (,) in , such that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems
