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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Jin Akiyama: A friend and his mathematics
M. Kano
,
Mari-Jo P. Ruiz
,
Jorge Urrutia
Graphs and Combinatorics
23
(S1), 2007, pp. 1-39
Some recent progress and applications in graph minor theory
Ken-ichi Kawarabayashi
,
Bojan Mohar
Graphs and Combinatorics
23
(1), 2007, pp. 1-46
Vas̑ek Chvátal: A very short introduction
David Avis
,
Adrian Bondy
,
William Cook
,
Bruce Reed
Graphs and Combinatorics
23
(S1), 2007, pp. 41-65
Bicolored matchings in some classes of graphs
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Graphs and Combinatorics
23
(1), 2007, pp. 47-60
Realizable quadruples for hex-polygons - Combinatorics of honeycombs
Krzysztof Koƚodziejczyk
Graphs and Combinatorics
23
(1), 2007, pp. 61-72
On the number of plane geometric graphs
Oswin Aichholzer
,
Thomas Hackl
,
Clemens Huemer
,
Ferran Hurtado
,
Hannes Krasser
,
Birgit Vogtenhuber
Graphs and Combinatorics
23
(S1), 2007, pp. 67-84
Three-class association schemes on Galois rings in characteristic 4
Jianmin Ma
Graphs and Combinatorics
23
(1), 2007, pp. 73-86
Bichromatic quadrangulations with Steiner points
Victor Alvarez
,
Toshinori Sakai
,
Jorge Urrutia
Graphs and Combinatorics
23
(S1), 2007, pp. 85-98
3-colorable even embeddings on closed surfaces
Atsuhiro Nakamoto
,
Norihito Sasanuma
Graphs and Combinatorics
23
(1), 2007, pp. 87-95
Non-jumping numbers for 4-uniform hypergraphs
Yuejian Peng
Graphs and Combinatorics
23
(1), 2007, pp. 97-110
Contractible edges in a 4-connected graph with vertices of degree greater than four
Kiyoshi Ando
,
Yoshimi Egawa
Graphs and Combinatorics
23
(S1), 2007, pp. 99-115
Difference families in
Z_{2d+1} \bigoplus Z_{2d+1}
and infinite translation designs in
Z \bigoplus Z
Andrea Vietri
Graphs and Combinatorics
23
(1), 2007, pp. 111-121
Enumerating non-crossing minimally rigid frameworks
David Avis
,
Naoki Katoh
,
Makoto Ohsaki
,
Ileana Streinu
,
Shin-ichi Tanigawa
Graphs and Combinatorics
23
(S1), 2007, pp. 117-134
Rainbows in the hypercube
Maria Axenovich
,
Heiko Harborth
,
Arnfried Kemnitz
,
Meinhard Möller
,
Ingo Schiermeyer
Graphs and Combinatorics
23
(2), 2007, pp. 123-133
Reduction for 3-connected graphs of minimum degree at least four
Sheng Bau
,
Akira Saito
Graphs and Combinatorics
23
(S1), 2007, pp. 135-144
Coverings of the vertices of a graph by small cycles
David Forge
,
Mekkia Kouider
Graphs and Combinatorics
23
(2), 2007, pp. 135-143
Opposite-quadrant depth in the plane
Hervé Brönnimann
,
Jonathan Lenchner
,
János Pach
Graphs and Combinatorics
23
(S1), 2007, pp. 145-152
Orthogonal double covers of complete graphs by caterpillars of diameter 5
Dalibor Froncek
Graphs and Combinatorics
23
(2), 2007, pp. 145-163
Santa Claus' Towers of Hanoi
Xiaomin Chen
,
Bin Tian
,
Lei Wang
Graphs and Combinatorics
23
(S1), 2007, pp. 153-167
Subdivision extendibility
Ronald Gould
,
Thor Whalen
Graphs and Combinatorics
23
(2), 2007, pp. 165-182
Efficient many-to-many point matching in one dimension
Justin Colannino
,
Mirela Damian
,
Ferran Hurtado
,
Stefan Langerman
,
Henk Meijer
,
Suneeta Ramaswami
,
Diane Souvaine
,
Godfried Toussaint
Graphs and Combinatorics
23
(S1), 2007, pp. 169-178
Epsilon-unfolding orthogonal polyhedra
Mirela Damian
,
Robin Flatland
,
Joseph O'Rourke
Graphs and Combinatorics
23
(S1), 2007, pp. 179-194
Enumeration of unlabelled mating graphs
Goran Kilibarda
Graphs and Combinatorics
23
(2), 2007, pp. 183-199
Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
Erik D. Demaine
,
Martin L. Demaine
Graphs and Combinatorics
23
(S1), 2007, pp. 195-208
Simple proofs of results on paths representing all colors in proper vertex-colorings
Chiang Lin
Graphs and Combinatorics
23
(2), 2007, pp. 201-203
Seiten 1
2
3
4
>