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=Discrete Math. AND Volume=121
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs with special neighbourhood orderings of vertices
Halina Bielak
Discrete Mathematics
121
(1-3), 1993, pp. 3-9
Classes of chromatically unique or equivalent graphs
Mieczysƚaw Borowiecki
,
Ewa Drgas-Burchardt
Discrete Mathematics
121
(1-3), 1993, pp. 11-18
A note on
K _4
-closures in Hamiltonian graph theory
H.J. Broersma
Discrete Mathematics
121
(1-3), 1993, pp. 19-23
Long cycles, degree sums and neighborhood unions
H.J. Broersma
,
J. van den Heuvel
,
H.J. Veldman
Discrete Mathematics
121
(1-3), 1993, pp. 25-35
Cycles of length 0 modulo 4 in graphs
Nathaniel Dean
,
Linda Lesniak
,
Akira Saito
Discrete Mathematics
121
(1-3), 1993, pp. 37-49
A note on the irredundance number after vertex deletion
Odile Favaron
Discrete Mathematics
121
(1-3), 1993, pp. 51-54
On the bipartite independence number of a balanced bipartite graph
Odile Favaron
,
Pedro Mago
,
Oscar Ordaz
Discrete Mathematics
121
(1-3), 1993, pp. 55-63
Some minimax problems for graphs
Miroslav Fiedler
Discrete Mathematics
121
(1-3), 1993, pp. 65-74
A decomposition for a class of
(P_5, {\bar{P}} _5)
-free graphs
J.L. Fouquet
Discrete Mathematics
121
(1-3), 1993, pp. 75-83
Mutual placement of bipartite graphs
Jean-Luc Fouquet
,
A. Pawel Wojda
Discrete Mathematics
121
(1-3), 1993, pp. 85-92
All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions
W. Frydrych
Discrete Mathematics
121
(1-3), 1993, pp. 93-104
Small periods of endomorphisms of trees
Rafaƚ Kalinowski
Discrete Mathematics
121
(1-3), 1993, pp. 105-111
The largest component in a random subgraph of the
n
-cycle
Gyula O.H. Katona
,
Louis V. Quintas
Discrete Mathematics
121
(1-3), 1993, pp. 113-116
Asymptotic normality of subcubes in random subgraphs of the
n
-cube
Urszula Konieczna
Discrete Mathematics
121
(1-3), 1993, pp. 117-122
Symmetric routings of the hypercube
Jean-Claude König
,
Dominique Sotteau
Discrete Mathematics
121
(1-3), 1993, pp. 123-134
Interval edge coloring of a graph with forbidden colors
Marek Kubale
Discrete Mathematics
121
(1-3), 1993, pp. 135-143
The primitivity of the strong product of two directed graphs
Maria Kwaśnik
Discrete Mathematics
121
(1-3), 1993, pp. 145-150
Majorization, packing, covering and matroids
Zbigniew Lonc
Discrete Mathematics
121
(1-3), 1993, pp. 151-157
Some special realizations of partition matrix sequences
Z. Majcher
Discrete Mathematics
121
(1-3), 1993, pp. 159-175
Covering spaces of locally homogeneous graphs
Roman Nedela
Discrete Mathematics
121
(1-3), 1993, pp. 177-188
N_2
-locally disconnected graphs
Zdenȇk Ryjác̑ek
Discrete Mathematics
121
(1-3), 1993, pp. 189-193
On 'maximal' Hamiltonian cycles in the square of a block
Günter Schaar
Discrete Mathematics
121
(1-3), 1993, pp. 195-198
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
Jerzy Topp
Discrete Mathematics
121
(1-3), 1993, pp. 199-210
On the length of longest dominating cycles in graphs
Hoa Vu Dinh
Discrete Mathematics
121
(1-3), 1993, pp. 211-222
Hamiltonian paths and Hamiltonian connectivity in graphs
Bing Wei
Discrete Mathematics
121
(1-3), 1993, pp. 223-228
Seiten 1
2
>