Figure - available from: Algorithmica
This content is subject to copyright. Terms and conditions apply.
![The labellings used in Lemma 7. On the left is the case when P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_2$$\end{document} has length greater than 1 and on the right when P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_2$$\end{document} has length 1. Dotted edges are missing](publication/379778159/figure/fig3/AS:11431281236030419@1712973238839/The-labellings-used-in-Lemma7-On-the-left-is-the-case-when.png)
The labellings used in Lemma 7. On the left is the case when P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_2$$\end{document} has length greater than 1 and on the right when P2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_2$$\end{document} has length 1. Dotted edges are missing
Source publication
![A petal of length k with terminals (lk,uk)\documentclass[12pt]{minimal}...](publication/379778159/figure/fig2/AS:11431281236030418@1712973238679/A-petal-of-length-k-with-terminals-lk-ukdocumentclass12ptminimal_Q320.jpg)
Since the CSP dichotomy conjecture has been established, a number of other dichotomy questions have attracted interest, including one for list homomorphism problems of signed graphs. Signed graphs arise naturally in many contexts, including for instance nowhere-zero flows for graphs embedded in non-orientable surfaces. The dichotomy classification...
Similar publications
It is shown that any two clauses in an instance of 3SAT sharing the same terminal which is positive in one clause and negated in the other can imply a new clause composed of the remaining terms from both clauses. Clauses can also imply other clauses as long as all the terms in the implying clauses exist in the implied clause. It is shown an instanc...
![The triangular-grid network T2\documentclass[12pt]{minimal}...](publication/380729372/figure/fig1/AS:11431281245931158@1716257341472/The-triangular-grid-network-T2documentclass12ptminimal-usepackageamsmath_Q320.jpg)
The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph G, we examine the problem of assigning directions to each edge of G such that the diameter of the resulting oriented graph is minimized. The minimum diameter over all strongly conne...
Graph burning models the propagation of information within a network as a stepwise process where at each step, one node becomes informed, and this information also spreads to all neighbors of previously informed nodes. Formally, graph burning is defined as follows: For an undirected graph G, at step t = 0 all vertices in G are unburned. At each ste...
