Skip to main content
People
Isfahan University of Technology
Finding Contents or People
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
Chromatic equivalence classes of certain generalized polygon trees III
Chromatic equivalence classes of certain cycles with edges
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Pairwise balanced designs and sigma clique partitions
Constructing regular graphs with smallest defining number
Local coloring of the Kneser graphs
On the local colorings of graphs
On the 1-2-3-conjecture
Local clique covering of claw-free graphs
Graph Coloring: Various Types, Applications and Open Problems
Star Edge Coloring of Cactus Graphs
A Havel-Hakimi type problem for oriented graphs
Star Edge Coloring of Cartesian Product of Graphs
Pagination
First page
« First
Previous page
‹‹
…
Page
145
Page
146
Page
147
Page
148
Current page
149
Page
150
Page
151
Page
152
Page
153
…
Next page
››
Last page
Last »
تحت نظارت وف ایرانی