-
81
-
82
Neighbor sum distinguishing total choice number of IC-planar graphs with restrictive conditions
Published 2023-04-01Subjects: “…ic-planar graphs…”
Get full text
Article -
83
Error-correction and noise-decoherence thresholds for coherent errors in planar-graph surface codes
Published 2020-12-01“…We numerically study coherent errors in surface codes on planar graphs, focusing on noise of the form of Z or X rotations of individual qubits. …”
Get full text
Article -
84
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles
Published 2019-11-01“…In this paper, we prove that if $G$ is a planar graph without chordal $4$- and $6$-cycles, then $G$ is equitably $k$-colorable and equitably $k$-choosable where $k\geq\max\{\Delta(G), 7\}$.…”
Get full text
Article -
85
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Published 2021-11-01Subjects: Get full text
Article -
86
Transfer-Efficient Face Routing Using the Planar Graphs of Neighbors in High Density WSNs
Published 2017-10-01Subjects: Get full text
Article -
87
Neighbor Sum Distinguishing Total Chromatic Number of Planar Graphs without 5-Cycles
Published 2020-02-01Subjects: Get full text
Article -
88
A modified PSO with fuzzy inference system for solving the planar graph coloring problem
Published 2010“…Hence, this study proposes a modified particle swarm optimization with fuzzy logic to obtain a high performance algorithm for solving the Planar Graph Coloring problem. Experimental results on several randomly generated graphs have illustrated the efficiency of the proposed method accordingly.…”
Get full text
Thesis -
89
-
90
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
Published 2020-11-01Subjects: “…planar graph…”
Get full text
Article -
91
An Efficient Polynomial Time Approximation Scheme for the Vertex Cover P3 Problem on Planar Graphs
Published 2019-02-01Subjects: Get full text
Article -
92
List edge and list total colorings of planar graphs without non-induced 7-cycles
Published 2013-03-01Get full text
Article -
93
Embeddings of 3-connected 3-regular planar graphs on surfaces of non-negative Euler characteristic
Published 2019-09-01“…Whitney's theorem states that every 3-connected planar graph is uniquely embeddable on the sphere. On the other hand, it has many inequivalent embeddings on another surface. …”
Get full text
Article -
94
-
95
Partitioning planar graphs with girth at least 9 into an edgeless graph and a graph with bounded size components
Published 2021-08-01Subjects: “…planar graph…”
Get full text
Article -
96
Local fractional metric dimension of rotationally symmetric planar graphs arisen from planar chorded cycles
Published 2023-06-01Subjects: “…rotationally symmetric planar graph…”
Get full text
Article -
97
The decycling number of a planar graph covered by <i>K<sub>4</sub></i>-subgraphs
Published 2024-01-01Get full text
Article -
98
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
Published 2011-09-01Get full text
Article -
99
-
100
New Expansion for Certain Isomers of Various Classes of Fullerenes
Published 2017-06-01Subjects: Get full text
Article