AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Let $G$ be a graph. Under a strong edge coloring of $G$, every color class is an induced matching. The strong chromatic index of $G$, denoted by $\chi'_s(G)$, is the smallest integer $k$ such that $G$ admits a strong edge coloring with $k$ colors. Denote by $\Delta(G)$ the maximum degree of $G$. In this paper, we prove...
For a graph $G$, a proper edge coloring of $G$ is called a D-coloring if every diamond subgraph of $G$ is rainbow. Let $\chi'_D(G)$ be the D-chromatic index of $G$, which is the smallest integer $k$ such that $G$ admits a D-coloring with $k$ colors. Let $\Delta$ be the maximum degree of $G$. The only known Brooks-type...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.