Font Size: a A A
Keyword [planar graph]
Result: 161 - 180 | Page: 9 of 10
161. Strict Neighbor-distinguishing Coloring Of Graphs
162. Structure Of Planar Graphs With Diameter 2 And Related Invariants Of Graphs
163. Linear Arboricity And Light Structure Of Graphs
164. The Linear 2-arboricity Of 1-planar Graphs
165. Research On Book Embedding Problem Of Some Types Of Graphs
166. Distinguishing Coloring Of IC-planar Graphs
167. Dynamic Coloring Of Some Topological Graphs
168. Vertex Coloring Of Graphs With Disabled Structure
169. List Strong Edge Coloring Of Planar Graphs With Maximum Degree 4
170. Neighbor Sum Distinguishing Total Coloring Of Planar Graphs With Cycle Conditions
171. The Linear 2-arboricity Of A Kind Of Graph And Neighbor Sum Distinguishing Total Coloring Of A Kind Of Ic-planar Graph
172. Constructions Of Basic Surfaces With Large Genus In Link Complements And Topological Graphs Of A Class Of Basic Surfaces
173. A Sufficient Condition For DP-4-colorable Planar Graphs
174. Every Projective Planar Graph G Without 6-cycles Adjacent To Triangles And M-graph Is DP-4-colorable
175. Weak Vertex-edge Coloring Of Plane Graphs
176. Dot Shade Problem For Graphs Under Constraints
177. Strict Neighbor-distinguishing Edge Coloring And Interval Edge Coloring Of Graphs
178. Vertex Partition Problems Of Planar Graphs With Girth Restrictions
179. Approximation Algorithms For Problems Related To The Node-weighted Generalized Steiner Forest Problem
180. Research On The Problem Of (2,1)-total Choosability Of Graphs
  <<First  <Prev  Next>  Last>>  Jump to