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

Finding Contents or People

Chromatic Classes of Certain 2-Connected Graphs
Chromaticity of Generalised Polygon Trees
A New Bound for Defining Numbers of Regular Graphs
Randomly Dimensional Graphs
Locating Chromatic Number of Graphs
Characterization of a Class of Hamiltonian Connected Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
On the Star Coloring of Graphs
2-Trees with Metric Dimension Two
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Graph Coloring: Various Types, Applications and Open Problems
Star Edge Coloring of Cactus Graphs
A Havel-Hakimi type problem for oriented graphs
Bounds on Some Variants of Clique Cover Numbers

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 45
  • Page 46
  • Page 47
  • Page 48
  • Current page 49
  • Page 50
  • Page 51
  • Page 52
  • Page 53
  • …
  • 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

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