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
Locating Chromatic Number of Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
On the Total Restrained Domination Number
Local Chromatic Number of Graphs
On the Defining Numbers of Cartesian Product of Cycles
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 simultaneous edge coloring of graphs
Some lower bounds for the L-intersection number of graphs
Bounds on Some Variants of Clique Cover Numbers
Injective chromatic number of outer planar graphs
Graph Coloring: Various Types, Applications and Open Problems
Star Edge Coloring of Cactus Graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 110
  • Page 111
  • Page 112
  • Page 113
  • Page 114
  • Page 115
  • Page 116
  • Page 117
  • Page 118
  • …
  • 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

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