The restricted arc-width of a graph.
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Arthur, David (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Barát, János, Hajnal, Péter (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Herbert Fleischner, Emanuel Wenger (1989)
Archivum Mathematicum
Similarity:
Hamada, Noboru, Maruta, Tatsuya, Oya, Yusuke (2012)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): E.4. Let q be a prime or a prime power ≥ 3. The purpose of this paper is to give a necessary and sufficient condition for the existence of an (n, r)-arc in PG(2, q ) for given integers n, r and q using the geometric structure of points and lines in PG(2, q ) for n > r ≥ 3. Using the geometric method and a computer, it is shown that there exists no (34, 3) arc in PG(2, 17), equivalently, there exists no [34, 3, 31] 17 code. ...
Poet, Jeffrey, Shader, Bryan L. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
T. Benton (1930)
Fundamenta Mathematicae
Similarity:
Chwe, Byoung-Song (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Alderson, T. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Danut Marcu (1986)
Publications de l'Institut Mathématique
Similarity:
D. S. Ramana (2010)
Acta Arithmetica
Similarity:
Saunders Mac Lane (1937)
Fundamenta Mathematicae
Similarity: