NSTL国家科技图书文献中心

1. Improved Outerplanarity Bounds for Planar Graphs NSTL国家科技图书文献中心

Therese Biedl | Debajyoti Mondal - 《Graph-Theoretic Concepts in Computer Science》 - International Workshop on Graph-Theoretic Concepts in Computer Science - 2025, - 92～106 - 共15页

摘要：In this paper, we study the outerplanarity* of* | graphs with outerplanarity* n/6 + Θ(1), and not* | difficult to show that the outerplanarity* can never be* | outerplanarity n/8 + O(1). We also show that the outerplanarity | planar embedding that achieves the outerplanarity* bound*

关键词： Planar graphs | Outerplanarity | Fence girth | Diameter

2. XNLP-Hardness of Parameterized Problems on Planar Graphs NSTL国家科技图书文献中心

Hans L. Bodlaender | Krisztina Szilagyi - 《Graph-Theoretic Concepts in Computer Science》 - International Workshop on Graph-Theoretic Concepts in Computer Science - 2025, - 107～120 - 共14页

摘要： outerplanarity, treewidth and pathwidth, thus strengthening | outerplanarity: All-or-Nothing Flow, Target Outdegree | outerplanarity. | The class XNLP consists of (parameterized | ) problems that can be solved nondeterministically in f(k)n

关键词： Parameterized complexity | XNLP | XALP | Planar graphs | Outerplanarity

3. Line graphs associated to Von Neumann regular graphs of rings NSTL国家科技图书文献中心

Boro, Laithun | Singh, Madan Mohan - 《Discrete mathematics, algorithms, and applications》 - 2024,16(2) - 共12页

摘要： having the planarity, the outerplanarity* and also being* | Let R be a commutative ring with unity | . Taloukolaei and Sahebi [Von Neumann regular graphs | associated with rings, Discrete Math. Algorithms Appl. 10(3 | ) (2018) 1850029, doi:10.1142/S1793830918500295

关键词： Von Neumann ring | Von Neumann regular graph | line graph | traversability | planarity | ELEMENTS

4. On the ideal-based zero-divisor graph of commutative rings NSTL国家科技图书文献中心

Selvakumar, K. | Anusha, N. - 《Discrete mathematics, algorithms, and applications》 - 2024,16(1) - 共14页

摘要： about the planarity, outerplanarity, genus and | Let R be a finite commutative ring with | identity, I be an ideal of R and J(R) denotes the | Jacobson radical of R. The ideal-based zero-divisor graph | gamma( I) (R) of R is a graph with vertex set V (gamma

关键词： Zero-divisor graph | Jacobson radical | perfect graph | planar | crosscap | CLASSIFICATION

5. Splitting Plane Graphs to Outerplanarity NSTL国家科技图书文献中心

Martin Gronemann | Martin Noellenburg ... - 《WALCOM: Algorithms and Computation: 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), March 22-24, 2023, Hsinchu, Taiwan》 - International Conference and Workshops on Algorithms and Computation - 2023, - 217～228 - 共12页

摘要： graph to outerplanarity, finding a connected face | Vertex splitting replaces a vertex by two | copies and partitions its incident edges amongst the | copies. This problem has been studied as a graph | editing operation to achieve desired properties with as

关键词： Vertex splitting | Outerplanarity | Feedback vertex set

6. Untangling circular drawings: Algorithms and complexity EI 工程索引 NSTL国家科技图书文献中心

Bhore S. | Li G.... - 《Computational geometry: Theory and applications》 - 2023,111 - 共5页

摘要：© 2022 The Author(s)We consider the problem of | untangling a given (non-planar) straight-line circular | drawing δG of an outerplanar graph G=(V,E) into a planar | straight-line circular drawing of G by shifting a minimum | number of vertices to a new position on the circle. For

关键词： NP-hardness | Outerplanarity | Permutations and combinations | Straight-line Graph drawing | Untangling

7. Planarizing Graphs and Their Drawings by Vertex Splitting NSTL国家科技图书文献中心

Martin Noellenburg | Manuel Sorge ... - 《Graph drawing and network visualization: 30th International Symposium on Graph Drawing and Network Visualization (GD 2022), September 13–16, 2022, Tokyo, Japan》 - International Symposium on Graph Drawing and Network Visualization - 2023, - 232～246 - 共15页

摘要： bounded outerplanarity* case and uses an intricate* | The splitting number of a graph G = (V, E) is | the minimum number of vertex splits required to turn | G into a planar graph, where a vertex split | removes a vertex v∈ V, introduces two new vertices v1

关键词： Vertex splitting | Planarization | Parameterized complexity

8. A Tipping Point for the Planarity of Small and Medium Sized Graphs NSTL国家科技图书文献中心

Emanuele Balloni | Giuseppe Di Battista ... - 《Graph drawing and network visualization :》 - International Symposium on Graph Drawing and Network Visualization - 2020, - 181～188 - 共8页

摘要： relaxations of planarity (we considered outerplanarity* and* | This paper presents an empirical study of the | relationship between the density of small-medium sized random | graphs and their planarity. It is well known that, when | the number of vertices tends to infinite, there is a

关键词： Planarity | Random graphs | Outerplanarity | Near-planarity

NSTL主题词： tilting | medium-size | Small

9. Small Universal Point Sets for k-Outerplanar Graphs NSTL国家科技图书文献中心

Angelini, Patrizio | Bruckdorfer, Till ... - 《Discrete & computational geometry》 - 2018,60(2) - 430～470 - 共41页

摘要： outerplanarity level is restricted to be a simple cycle (simply | A point set is universal for a class of planar | graphs if every graph of has a planar straight-line | embedding on . It is well-known that the integer grid is a | quadratic-size universal point set for planar graphs

关键词： Universal point sets | Planar graphs | k-outerplanarity

10. Planarity and outerplanarity indexes of the zero-divisor graphs SCOPUS Scopus数据库 NSTL国家科技图书文献中心

Zahra Barati - 《Afrika matematika》 - 2017,28(3/4) - 505～514 - 共10页

摘要： planarity and outerplanarity* of iterated line graphs of* | outerplanarity indexes. | In this paper, we consider the problem of | the zero divisor graphs for finite commutative rings | . We give a full characterization of all zero divisor

摘要：In this paper, we study the outerplanarity* of* | graphs with outerplanarity* n/6 + Θ(1), and not* | difficult to show that the outerplanarity* can never be* | outerplanarity n/8 + O(1). We also show that the outerplanarity | planar embedding that achieves the outerplanarity* bound*

关键词： Planar graphs | Outerplanarity | Fence girth | Diameter

摘要： outerplanarity, treewidth and pathwidth, thus strengthening | outerplanarity: All-or-Nothing Flow, Target Outdegree | outerplanarity. | The class XNLP consists of (parameterized | ) problems that can be solved nondeterministically in f(k)n

关键词： Parameterized complexity | XNLP | XALP | Planar graphs | Outerplanarity

摘要： having the planarity, the outerplanarity* and also being* | Let R be a commutative ring with unity | . Taloukolaei and Sahebi [Von Neumann regular graphs | associated with rings, Discrete Math. Algorithms Appl. 10(3 | ) (2018) 1850029, doi:10.1142/S1793830918500295

关键词： Von Neumann ring | Von Neumann regular graph | line graph | traversability | planarity | ELEMENTS

摘要： about the planarity, outerplanarity, genus and | Let R be a finite commutative ring with | identity, I be an ideal of R and J(R) denotes the | Jacobson radical of R. The ideal-based zero-divisor graph | gamma( I) (R) of R is a graph with vertex set V (gamma

关键词： Zero-divisor graph | Jacobson radical | perfect graph | planar | crosscap | CLASSIFICATION

摘要： graph to outerplanarity, finding a connected face | Vertex splitting replaces a vertex by two | copies and partitions its incident edges amongst the | copies. This problem has been studied as a graph | editing operation to achieve desired properties with as

关键词： Vertex splitting | Outerplanarity | Feedback vertex set

摘要：© 2022 The Author(s)We consider the problem of | untangling a given (non-planar) straight-line circular | drawing δG of an outerplanar graph G=(V,E) into a planar | straight-line circular drawing of G by shifting a minimum | number of vertices to a new position on the circle. For

关键词： NP-hardness | Outerplanarity | Permutations and combinations | Straight-line Graph drawing | Untangling

摘要： bounded outerplanarity* case and uses an intricate* | The splitting number of a graph G = (V, E) is | the minimum number of vertex splits required to turn | G into a planar graph, where a vertex split | removes a vertex v∈ V, introduces two new vertices v1

关键词： Vertex splitting | Planarization | Parameterized complexity

摘要： relaxations of planarity (we considered outerplanarity* and* | This paper presents an empirical study of the | relationship between the density of small-medium sized random | graphs and their planarity. It is well known that, when | the number of vertices tends to infinite, there is a

关键词： Planarity | Random graphs | Outerplanarity | Near-planarity

NSTL主题词： tilting | medium-size | Small

摘要： outerplanarity level is restricted to be a simple cycle (simply | A point set is universal for a class of planar | graphs if every graph of has a planar straight-line | embedding on . It is well-known that the integer grid is a | quadratic-size universal point set for planar graphs

关键词： Universal point sets | Planar graphs | k-outerplanarity

摘要： planarity and outerplanarity* of iterated line graphs of* | outerplanarity indexes. | In this paper, we consider the problem of | the zero divisor graphs for finite commutative rings | . We give a full characterization of all zero divisor

关键词： Zero-divisor graph | Iterated line graph | Planarity index | Outerplanarity index

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：In this paper, we study the outerplanarity of | graphs with outerplanarity n/6 + Θ(1), and not | difficult to show that the outerplanarity can never be | outerplanarity n/8 + O(1). We also show that the outerplanarity | planar embedding that achieves the outerplanarity bound

关键词： Planar graphs | Outerplanarity | Fence girth | Diameter

摘要： outerplanarity, treewidth and pathwidth, thus strengthening | outerplanarity: All-or-Nothing Flow, Target Outdegree | outerplanarity. | The class XNLP consists of (parameterized | ) problems that can be solved nondeterministically in f(k)n

关键词： Parameterized complexity | XNLP | XALP | Planar graphs | Outerplanarity

摘要： having the planarity, the outerplanarity and also being | Let R be a commutative ring with unity | . Taloukolaei and Sahebi [Von Neumann regular graphs | associated with rings, Discrete Math. Algorithms Appl. 10(3 | ) (2018) 1850029, doi:10.1142/S1793830918500295

关键词： Von Neumann ring | Von Neumann regular graph | line graph | traversability | planarity | ELEMENTS

摘要： about the planarity, outerplanarity, genus and | Let R be a finite commutative ring with | identity, I be an ideal of R and J(R) denotes the | Jacobson radical of R. The ideal-based zero-divisor graph | gamma( I) (R) of R is a graph with vertex set V (gamma

关键词： Zero-divisor graph | Jacobson radical | perfect graph | planar | crosscap | CLASSIFICATION

摘要： graph to outerplanarity, finding a connected face | Vertex splitting replaces a vertex by two | copies and partitions its incident edges amongst the | copies. This problem has been studied as a graph | editing operation to achieve desired properties with as

关键词： Vertex splitting | Outerplanarity | Feedback vertex set

摘要：© 2022 The Author(s)We consider the problem of | untangling a given (non-planar) straight-line circular | drawing δG of an outerplanar graph G=(V,E) into a planar | straight-line circular drawing of G by shifting a minimum | number of vertices to a new position on the circle. For

关键词： NP-hardness | Outerplanarity | Permutations and combinations | Straight-line Graph drawing | Untangling

摘要： bounded outerplanarity case and uses an intricate | The splitting number of a graph G = (V, E) is | the minimum number of vertex splits required to turn | G into a planar graph, where a vertex split | removes a vertex v∈ V, introduces two new vertices v1

关键词： Vertex splitting | Planarization | Parameterized complexity

摘要： relaxations of planarity (we considered outerplanarity and | This paper presents an empirical study of the | relationship between the density of small-medium sized random | graphs and their planarity. It is well known that, when | the number of vertices tends to infinite, there is a

关键词： Planarity | Random graphs | Outerplanarity | Near-planarity

NSTL主题词： tilting | medium-size | Small

摘要： outerplanarity level is restricted to be a simple cycle (simply | A point set is universal for a class of planar | graphs if every graph of has a planar straight-line | embedding on . It is well-known that the integer grid is a | quadratic-size universal point set for planar graphs

关键词： Universal point sets | Planar graphs | k-outerplanarity

摘要： planarity and outerplanarity of iterated line graphs of | outerplanarity indexes. | In this paper, we consider the problem of | the zero divisor graphs for finite commutative rings | . We give a full characterization of all zero divisor

关键词： Zero-divisor graph | Iterated line graph | Planarity index | Outerplanarity index

4008-161-200 800-990-8900

国家科技图书文献中心

摘要：In this paper, we study the outerplanarity* of* | graphs with outerplanarity* n/6 + Θ(1), and not* | difficult to show that the outerplanarity* can never be* | outerplanarity n/8 + O(1). We also show that the outerplanarity | planar embedding that achieves the outerplanarity* bound*

摘要： having the planarity, the outerplanarity* and also being* | Let R be a commutative ring with unity | . Taloukolaei and Sahebi [Von Neumann regular graphs | associated with rings, Discrete Math. Algorithms Appl. 10(3 | ) (2018) 1850029, doi:10.1142/S1793830918500295

摘要： bounded outerplanarity* case and uses an intricate* | The splitting number of a graph G = (V, E) is | the minimum number of vertex splits required to turn | G into a planar graph, where a vertex split | removes a vertex v∈ V, introduces two new vertices v1

摘要： relaxations of planarity (we considered outerplanarity* and* | This paper presents an empirical study of the | relationship between the density of small-medium sized random | graphs and their planarity. It is well known that, when | the number of vertices tends to infinite, there is a

摘要： planarity and outerplanarity* of iterated line graphs of* | outerplanarity indexes. | In this paper, we consider the problem of | the zero divisor graphs for finite commutative rings | . We give a full characterization of all zero divisor