AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 66 papers
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.
A graph $G$ is \emph{$H$-induced-saturated} if $G$ has no induced subgraph isomorphic to $H$ but changing the adjacency of an arbitrary pair of vertices in $G$ creates an induced copy of $H$. The existence problem for $H$-induced-saturated graphs had previously been settled when $H$ is a complete graph, a path, an odd...
A graph has an ‐coloring if there exists an assignment from the vertices to subsets of with size such that adjacent vertices are assigned disjoint subsets. Odd girth at least is a necessary condition for a graph to have a ‐coloring. Chen and Raspaud conjectured a tight upper bound on the maximum average degree of...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.