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=Graphs and Combinatorics AND Volume=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A finiteness theorem for maximal independent sets
Min-Jen Jou
,
Gerard J. Chang
,
Chiang Lin
,
Tze-Heng Ma
Graphs and Combinatorics
12
, 1996, pp. 321-326
Perfect matchings in regular bipartite graphs
P. Katerinis
,
N. Tsikopoulos
Graphs and Combinatorics
12
, 1996, pp. 327-331
The minimum diameter of orientations of complete multipartite graphs
K.M. Koh
,
B.P. Tan
Graphs and Combinatorics
12
, 1996, pp. 333-339
A spatial unit-bar-framework which is rigid and triangle-free
Hiroshi Maehara
,
Norihide Tokushige
Graphs and Combinatorics
12
, 1996, pp. 341-344
Minimal colorings for properly colored subgraphs
Y. Manoussakis
,
M. Spyratos
,
Zs. Tuza
,
M. Voigt
Graphs and Combinatorics
12
, 1996, pp. 345-360
Maximally non-Hamiltonian graphs of girth 7
Ladislav Stacho
Graphs and Combinatorics
12
, 1996, pp. 361-371
On long cycles in 2-connected bipartite graph
Hong Wang
Graphs and Combinatorics
12
, 1996, pp. 373-384
Hamiltonian cycles in 1-tough graphs
Bing Wei
Graphs and Combinatorics
12
, 1996, pp. 385-395
Seiten
<
1
2