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

Finding Contents or People

Chromatic equivalence classes of certain cycles with edges
On Vertex-Coloring 2-Edge-Weighting of Graphs
Chromaticity of Generalised Polygon Trees
Small oriented cycle double cover of graphs
On the oriented perfect path double cover conjecture
On the simultaneous edge coloring of graphs
On the 1-2-3-conjecture
Pairwise balanced designs and sigma clique partitions
An Enforced Hill Climbing Based System for General Game Playing
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
A polynomial time algorithm to find the star chromatic index of trees
Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 443
  • Page 444
  • Page 445
  • Page 446
  • Page 447
  • Page 448
  • Page 449
  • Page 450
  • Page 451
  • …
  • 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

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