Font Size: a A A
Keyword [Discharging]
Result: 61 - 78 | Page: 4 of 4
61. The Neighbor-distinguishing Edge Chromatic Number And Total Chromatic Number Of Graphs
62. DP-3-coloring Of Planar Graphs
63. Planar Graphs Without 3,8,9-cycles Are DP-3-colorable
64. DP-4-coloring Of Planar Graphs Without 5-cycles Adjacent To 6-cycles Or Intersecting 5-cycles
65. Study On The Mechanism Of Enhanced Degradation Of Florfenicol And Simultaneous Denitrification By Integrating Solar Photovoltaic Capacitor Into Algal-bacterial Photo-bioelectrochemical System
66. The K-L(P,1)-choosability Of Planar Graphs
67. Study On DP-coloring And List Coloring Problems Of Planar Graphs
68. Vertex Forest Partitioning Of Graphs
69. An Upper Bound On The Chromatic Number Of The Square Graph Of Sparse Graphs
70. Distinguishing Coloring Of IC-planar Graphs
71. Neighbor Sum Distinguishing Total Coloring Of Planar Graphs With Cycle Conditions
72. The Linear 2-arboricity Of A Kind Of Graph And Neighbor Sum Distinguishing Total Coloring Of A Kind Of Ic-planar Graph
73. Variation Characteristics And Mechanism Of Turbidity Maximum Zone Of The Yangtze River Estuary Under The Condition Of Declining Fluvial Sediment Discharging
74. Planar Graphs Without 5-,6-cycles And Triangle 7-cycles And With Distance Of Triangles At Least 2 Are DP-3-colorable
75. A Sufficient Condition For DP-4-colorable Planar Graphs
76. Every Projective Planar Graph G Without 6-cycles Adjacent To Triangles And M-graph Is DP-4-colorable
77. Dynamic Coloring Of Some Graph Classes
78. Discharge Inducing,Discharging Process And Protein Components Of Protrichocysts Of Ciliate
  <<First  <Prev  Next>  Last>>  Jump to