Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Graph Theory AND YEAR=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the existence of generalized good and equitable edge colorings
D. de Werra
Journal of Graph Theory
5
(3), 1981, pp. 247-258
A new planarity criterion for 3-connected graphs
Alexander K. Kelmans
Journal of Graph Theory
5
(3), 1981, pp. 259-267
On the edge-coloring problem for a class of 4-regular maps
F. Jaeger
,
H. Shank
Journal of Graph Theory
5
(3), 1981, pp. 269-275
The
\lambda
-complete multigraphs
M.L. Gardner
Journal of Graph Theory
5
(3), 1981, pp. 277-283
Matchings and walks in graphs
C.D. Godsil
Journal of Graph Theory
5
(3), 1981, pp. 285-297
Chromatic numbers of hypergraphs and coverings of graphs
Zevi Miller
,
Heinrich Müller
Journal of Graph Theory
5
(3), 1981, pp. 299-305
Hamiltonian line graphs
Richard A. Brualdi
,
Robert F. Shanny
Journal of Graph Theory
5
(3), 1981, pp. 307-314
A census of maximum uniquely Hamiltonian graphs
Curtiss A. Barefoot
,
R.C. Entringer
Journal of Graph Theory
5
(3), 1981, pp. 315-321
A characterization of Ptolemaic graphs
Edward Howorka
Journal of Graph Theory
5
(3), 1981, pp. 323-331
Meyniel's theorem for strongly
(p,q)
-Hamiltonian digraphs
A.P. Wojda
Journal of Graph Theory
5
(3), 1981, pp. 333-335
Some results on the genus of a group
Thomas W. Tucker
Journal of Graph Theory
5
(3), 1981, pp. 337-338
On the origin of the
n
-arc theorem
Karl Menger
Journal of Graph Theory
5
(4), 1981, pp. 341-350
Nonseparating cycles in
k
-connected graphs
Carsten Thomassen
Journal of Graph Theory
5
(4), 1981, pp. 351-354
Quadrilateral embeddings of bipartite graphs
Ian Anderson
Journal of Graph Theory
5
(4), 1981, pp. 355-361
Some arrowing results for trees versus complete graphs
Albert D. Polimeni
,
H. Joseph Straight
,
Jay Yellen
Journal of Graph Theory
5
(4), 1981, pp. 363-369
On an adjacency property of graphs
Geoffrey Exoo
Journal of Graph Theory
5
(4), 1981, pp. 371-378
Which rational numbers are binding numbers?
V.G. Kane
,
S.P. Mohanty
,
E.G. Straus
Journal of Graph Theory
5
(4), 1981, pp. 379-384
Generalized line graphs
Dragos̑ Cvetković
,
Michael Doob
,
Slobodan Simić
Journal of Graph Theory
5
(4), 1981, pp. 385-399
Characterizations of signed graphs
Thomas Zaslavsky
Journal of Graph Theory
5
(4), 1981, pp. 401-406
Maximal non-Hamilton-laceable graphs
Gustavus J. Simmons
Journal of Graph Theory
5
(4), 1981, pp. 407-415
Locally homogeneous graphs from groups
Andrew Vince
Journal of Graph Theory
5
(4), 1981, pp. 417-422
Generating all 4-regular planar graphs from the graph of the octahedron
Jenö Lehel
Journal of Graph Theory
5
(4), 1981, pp. 423-426
On graphs containing a given graph as center
Fred Buckley
,
Zevi Miller
,
Peter J. Slater
Journal of Graph Theory
5
(4), 1981, pp. 427-434
Paley graphs satisfy all first-order adjacency axioms
Andreas Blass
,
Geoffrey Exoo
,
Frank Harary
Journal of Graph Theory
5
(4), 1981, pp. 435-439
A remark on the factor theorems of Lovász and Tutte
Carsten Thomassen
Journal of Graph Theory
5
(4), 1981, pp. 441-442
Seiten
<
1
2
3
>