Skip to main content
خانه
People
Isfahan University of Technology

Finding Contents or People

On the Dominating Coloring
Local Chromatic Number of Graphs
Distance Locating Sets in Graphs
On the Defining Numbers of Cartesian Product of Cycles
Chromatic Classes of Certain 2-Connected Graphs
A New Bound for Defining Numbers of Regular Graphs
Small oriented cycle double cover of graphs
On the oriented perfect path double cover conjecture
On the 1-2-3-conjecture
Pairwise balanced designs and sigma clique partitions
Some lower bounds for the L-intersection number of graphs
Bounds on Some Variants of Clique Cover Numbers
Graph Coloring: Various Types, Applications and Open Problems
Star Edge Coloring of Cactus Graphs
A Havel-Hakimi type problem for oriented graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 93
  • Page 94
  • Page 95
  • Page 96
  • Page 97
  • Page 98
  • Page 99
  • Page 100
  • Page 101
  • …
  • Next page ››
  • Last page Last »
Main navigation
  • Login
  • Manual
  • University Home Page
  • Home
  • Index

Provided by Information Technology Manager of Isfahan University of Technology (https://it.iut.ac.ir)

Support and send ticket

تحت نظارت وف ایرانی