Login
|
New Account
AAAAAA
ITA
ENG
Results:
<<
|
201-225
|
226-250
|
251-275
|
276-300
|
>>
Table of contents of journal:
*Journal of graph theory
Results: 201-225/506
VERTEX-TRANSITIVE GRAPHS THAT ARE NOT CAYLEY-GRAPHS .2.
Authors:
MCKAY BD PRAEGER CE
Citation:
Bd. Mckay et Ce. Praeger, VERTEX-TRANSITIVE GRAPHS THAT ARE NOT CAYLEY-GRAPHS .2., Journal of graph theory, 22(4), 1996, pp. 321-334
ON AVOIDABLE AND UNAVOIDABLE TREES
Authors:
LU XY
Citation:
Xy. Lu, ON AVOIDABLE AND UNAVOIDABLE TREES, Journal of graph theory, 22(4), 1996, pp. 335-346
CARTESIAN PRODUCTS OF TREES AND PATHS
Authors:
BANDELT HJ BUROSCH G LABORDE JM
Citation:
Hj. Bandelt et al., CARTESIAN PRODUCTS OF TREES AND PATHS, Journal of graph theory, 22(4), 1996, pp. 347-356
ON BOUNDED AUTOMORPHISMS OF LOCALLY FINITE TRANSITIVE GRAPHS
Authors:
NIEMEYER P
Citation:
P. Niemeyer, ON BOUNDED AUTOMORPHISMS OF LOCALLY FINITE TRANSITIVE GRAPHS, Journal of graph theory, 22(4), 1996, pp. 357-365
CHROMATIC POLYNOMIALS AND SIGMA-POLYNOMIALS
Authors:
WAKELIN CD
Citation:
Cd. Wakelin, CHROMATIC POLYNOMIALS AND SIGMA-POLYNOMIALS, Journal of graph theory, 22(4), 1996, pp. 367-381
ANNOUNCEMENT FROM THE PUBLISHER
Authors:
PAVLO E
Citation:
E. Pavlo, ANNOUNCEMENT FROM THE PUBLISHER, Journal of graph theory, 22(3), 1996, pp. 1-1
SUBDIVISIONS AND THE CHROMATIC INDEX OF R-GRAPHS
Authors:
KILAKOS K SHEPHERD FB
Citation:
K. Kilakos et Fb. Shepherd, SUBDIVISIONS AND THE CHROMATIC INDEX OF R-GRAPHS, Journal of graph theory, 22(3), 1996, pp. 203-212
DOMINATION NUMBERS OF PLANAR GRAPHS
Authors:
MACGILLIVRAY G SEYFFARTH K
Citation:
G. Macgillivray et K. Seyffarth, DOMINATION NUMBERS OF PLANAR GRAPHS, Journal of graph theory, 22(3), 1996, pp. 213-229
EDGE-DISJOINT CYCLES IN REGULAR DIRECTED-GRAPHS
Authors:
ALON N MCDIARMID C MOLLOY M
Citation:
N. Alon et al., EDGE-DISJOINT CYCLES IN REGULAR DIRECTED-GRAPHS, Journal of graph theory, 22(3), 1996, pp. 231-237
THE CROSSING NUMBER OF C-5XC-N
Authors:
KLESC M RICHTER RB STOBERT I
Citation:
M. Klesc et al., THE CROSSING NUMBER OF C-5XC-N, Journal of graph theory, 22(3), 1996, pp. 239-243
EVERY 2-CHOOSABLE GRAPH IS (2M, M)-CHOOSABLE
Authors:
TUZA Z VOIGT M
Citation:
Z. Tuza et M. Voigt, EVERY 2-CHOOSABLE GRAPH IS (2M, M)-CHOOSABLE, Journal of graph theory, 22(3), 1996, pp. 245-252
DECOMPOSITIONS AND REDUCTIONS OF SNARKS
Authors:
NEDELA R SKOVIERA M
Citation:
R. Nedela et M. Skoviera, DECOMPOSITIONS AND REDUCTIONS OF SNARKS, Journal of graph theory, 22(3), 1996, pp. 253-279
A CHARACTERIZATION OF PANCONNECTED GRAPHS SATISFYING A LOCAL ORE-TYPECONDITION
Authors:
ASRATIAN AS HAGGKVIST R SARKISIAN GV
Citation:
As. Asratian et al., A CHARACTERIZATION OF PANCONNECTED GRAPHS SATISFYING A LOCAL ORE-TYPECONDITION, Journal of graph theory, 22(2), 1996, pp. 95-103
HAMILTONICITY OF REGULAR 2-CONNECTED GRAPHS
Authors:
BROERSMA HJ VANDENHEUVEL J JACKSON B VELDMAN HJ
Citation:
Hj. Broersma et al., HAMILTONICITY OF REGULAR 2-CONNECTED GRAPHS, Journal of graph theory, 22(2), 1996, pp. 105-124
A NEW CHARACTERIZATION OF GRAPHS BASED ON INTERCEPTION RELATIONS
Authors:
PAZ A PEARL J UR S
Citation:
A. Paz et al., A NEW CHARACTERIZATION OF GRAPHS BASED ON INTERCEPTION RELATIONS, Journal of graph theory, 22(2), 1996, pp. 125-136
ON THE EMBEDDING OF GRAPHS INTO GRAPHS WITH FEW EIGENVALUES
Authors:
VU VH
Citation:
Vh. Vu, ON THE EMBEDDING OF GRAPHS INTO GRAPHS WITH FEW EIGENVALUES, Journal of graph theory, 22(2), 1996, pp. 137-149
A REDUCTION CRITERION FOR SUPEREULERIAN GRAPHS
Authors:
CATLIN PA
Citation:
Pa. Catlin, A REDUCTION CRITERION FOR SUPEREULERIAN GRAPHS, Journal of graph theory, 22(2), 1996, pp. 151-153
ON D-DIAGONAL COLORINGS
Authors:
SANDERS DP ZHAO Y
Citation:
Dp. Sanders et Y. Zhao, ON D-DIAGONAL COLORINGS, Journal of graph theory, 22(2), 1996, pp. 155-166
PANCYCLICITY OF CONNECTED CIRCULANT GRAPHS
Authors:
BOGDANOWICZ ZR
Citation:
Zr. Bogdanowicz, PANCYCLICITY OF CONNECTED CIRCULANT GRAPHS, Journal of graph theory, 22(2), 1996, pp. 167-174
THE SPECTRUM PROBLEM FOR THE PETERSEN GRAPH
Authors:
ADAMS P BRYANT DE
Citation:
P. Adams et De. Bryant, THE SPECTRUM PROBLEM FOR THE PETERSEN GRAPH, Journal of graph theory, 22(2), 1996, pp. 175-180
SUFFICIENT CONDITIONS FOR A DIGRAPH TO BE HAMILTONIAN
Authors:
BANGJENSEN J GUTIN G LI H
Citation:
J. Bangjensen et al., SUFFICIENT CONDITIONS FOR A DIGRAPH TO BE HAMILTONIAN, Journal of graph theory, 22(2), 1996, pp. 181-187
COLORINGS OF INFINITE-GRAPHS WITHOUT ONE-COLORED RAYS
Authors:
POLAT N
Citation:
N. Polat, COLORINGS OF INFINITE-GRAPHS WITHOUT ONE-COLORED RAYS, Journal of graph theory, 22(2), 1996, pp. 189-201
RAMSEY-TYPE RESULTS FOR ORIENTED TREES
Authors:
KOHAYAKAWA Y LUCZAK T RODL V
Citation:
Y. Kohayakawa et al., RAMSEY-TYPE RESULTS FOR ORIENTED TREES, Journal of graph theory, 22(1), 1996, pp. 1-8
DOMINATION CRITICAL GRAPHS WITH HIGHER INDEPENDENT DOMINATION NUMBERS
Authors:
AO S COCKAYNE EJ MACGILLIVRAY G MYNHARDT CM
Citation:
S. Ao et al., DOMINATION CRITICAL GRAPHS WITH HIGHER INDEPENDENT DOMINATION NUMBERS, Journal of graph theory, 22(1), 1996, pp. 9-14
THE AVERAGE STEINER DISTANCE OF A GRAPH
Authors:
DANKELMANN P OELLERMANN OR SWART HC
Citation:
P. Dankelmann et al., THE AVERAGE STEINER DISTANCE OF A GRAPH, Journal of graph theory, 22(1), 1996, pp. 15-22
Risultati:
<<
|
201-225
|
226-250
|
251-275
|
276-300
|
>>