Skip to main content

Articles

type: Conference
Title Date
On the size-Ramsey number of some sparse graphs 2017-08
The Structure of Claw-free Graphs and Their Edge Clique Covering 2017-05
Bounds on Some Variants of Clique Cover Numbers 2015-08
NULL 2014-09
Nordhaus-Gaddum Inequalities for Sigma Clique Partition Number of Graphs 2014-08
Nordhaus-Gaddum Inequalities for sigma clique partition number of graphs 2014-08
Local Boolean Rank of Matrices and a new Bollobas-type inequality in Set Systems 2013-08
A variant of edge clique covering 2012-11
Algorithmic aspects of isoperimetric problems 2012-08
type: Journal
Title DOI Date
Edge clique covering sum of graphs # 2016-03
Pairwise balanced designs and sigma clique partitions # 2016-01
Local Clique Covering of Claw-Free Graphs # 2015-02
Clustering and outlier detection using isoperimetric number of trees # 2013-12
On the complexity of isoperimetric problems on trees # 2011-04
On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes # 2011-04
On b-coloring of cartesian product of graphs # 2011-04
On the isoperimetric spectrum of graphs and its approximations # 2009-04

Pagination

  • First page « First
  • Previous page ‹‹
  • Page 1
  • Page 2

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

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