Graph property

Known as: Graph invariant, Graph properties 
In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
A property of finite graphs is called nondeterministically testable if it has a " certificate " such that once the certificate is… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
A common thread in recent results concerning the testing of dense graphs is the use of Szemerédi's regularity lemma. In this… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Property testing is a relaxation of decision problems in which it is required to distinguish YES-instances (i.e., objects having… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Consider G(n, p) to be the probability space of random graphs on n vertices with edge probability p. We will be considering… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We further develop the study of testing graph properties as initiated by Goldreich, Goldwasser and Ron. Loosely speaking, given… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In their seminal work which initiated random graph theory Erd os and R enyi discovered that many graph properties have sharp… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Graphs are finite and handled as relational structures. We give some answers to the following general questions: (1) For which… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?