398 search results - page 6 / 80 » Critical exponents of graphs |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
128
click to vote
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...
ENDM
2008
14 years 10 months ago
2008
The structure of all known infinite families of crossing
COMBINATORICS
2007
14 years 10 months ago
2007
We prove that if G is a graph containing a doubly-critical edge and satisfying χ ≥ ∆ ≥ 6, then G contains a K∆.