The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a graph G = (V,E) with a set W ⊆ V of vertices, we enumerate colorings to W such that for every two enumerated colorings c and c' the corresponding colored graphs (G, c) and (G, c') are not isomorphic. This problem has an important application in the study of isomers of chemical graphs such as generation of benzen isomers from a tree-like chemical graph structure. The number of such colorings...
Symmetry is one of the most important aesthetic criteria in Graph Drawing which can reveal the hidden structure in the graph. Convex drawing is a straight-line drawing where every facial cycle is drawn as a convex polygon. In this paper, we prove that given an internally triconnected plane graph with symmetries, there exists a convex drawing of the graph which displays the given symmetries. We present...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.