Skip to main content
خانه
Dr. Behnaz Omoomi
Professor of Mathematical Sciences

Articles

type: Conference
Title DOI Date Conference Title
Chromatic Classes of Certain 2-Connected Graphs 1381 - 06
chromaticity of generalized polygon trees 1379 - 04
A new bound for defining number of regular graphs 1378 - 12
type:
Title DOI Date Conference Title
Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment -
Personalized Privacy Preserving Method for Social Networks Graph k-Anonymization -
A polynomial time algorithm to find the star chromatic index of trees -
Star edge coloring of the Cartesian product of graphs -
A Havel-Hakimi type problem for oriented graphs -
Graph Coloring: Various Types, Applications and Open Problems -
Star Edge Coloring of Cartesian Product of Graphs -
Star Edge Coloring of Cactus Graphs -
Injective chromatic number of outer planar graphs -
A characterization of some graphs with metric dimension two -
Clique-coloring of K3, 3-minor free graphs -
Set Intersection Representations of Graphs -
Bounds on Some Variants of Clique Cover Numbers -
Star edge coloring of Cactus graphs -
An Enforced Hill Climbing Based System for General Game Playing -
Edge clique covering sum of graphs -
Some lower bounds for the L-intersection number of graphs -

Pagination

  • First page « First
  • Previous page ‹‹
  • Page 1
  • Page 2
  • Page 3
  • Page 4
  • Page 5
  • Page 6
  • Page 7
  • 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

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