534 search results - page 20 / 107 » Diameter critical graphs |
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
132
Voted
ENDM
2000
14 years 10 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
72
Voted
ENDM
2008
14 years 11 months ago
2008
The structure of all known infinite families of crossing
COMBINATORICS
2007
14 years 11 months ago
2007
We prove that if G is a graph containing a doubly-critical edge and satisfying χ ≥ ∆ ≥ 6, then G contains a K∆.
ENTCS
2008
14 years 10 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...