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
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Constructing regular graphs with smallest defining number
Local coloring of the Kneser graphs
On the local colorings of graphs
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
Star edge coloring of the Cartesian product of graphs
Personalized Privacy Preserving Method for Social Networks Graph k-Anonymization
Set Intersection Representations of Graphs
Star edge coloring of Cactus graphs
Pagination
First page
« First
Previous page
‹‹
…
Page
76
Page
77
Page
78
Page
79
Current page
80
Page
81
Page
82
Page
83
Page
84
…
Next page
››
Last page
Last »
تحت نظارت وف ایرانی