scientific article; zbMATH DE number 3860848

From MaRDI portal
Publication:3329183





[For the entire collection see Zbl 0511.00037.] The paper is a comparatively narrow survey of results on the investigation of graph placement problems. There is an information on the complexity of some sufficiently general problems of the undirected graphs placement and a formulation of several problems of linear placement (or equivalently nodes enumeration) of undirected graphs. The main emphasis is laid on problems of nodes enumeration of regular graphs. Some applications-oriented examples are presented.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3329183)