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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the intersection problem for Steiner triple systems of different orders
Peter Danziger
,
Peter Dukes
,
Terry Griggs
,
Eric Mendelsohn
Graphs and Combinatorics
22
(3), 2006, pp. 311-329
On Hamilton cycle decomposition of 6-regular circulant graphs
Matthew Dean
Graphs and Combinatorics
22
(3), 2006, pp. 331-340
On the neighbour-distinguishing index of a graph
Keith Edwards
,
Mirko Horn̑ák
,
Mariusz Woźniak
Graphs and Combinatorics
22
(3), 2006, pp. 341-350
A five color zero-sum generalization
David Grynkiewicz
,
Andrew Schultz
Graphs and Combinatorics
22
(3), 2006, pp. 351-360
Contractible cliques in
k
-connected graphs
Xiaolong Huang
,
Zemin Jin
,
Xingxing Yu
,
Xiaoyan Zhang
Graphs and Combinatorics
22
(3), 2006, pp. 361-370
On a
k
-tree containing specified leaves in a graph
Haruhide Matsuda
,
Hajime Matsumura
Graphs and Combinatorics
22
(3), 2006, pp. 371-381
Circuits and cocircuits in regular matroids
Dillon Mayhew
Graphs and Combinatorics
22
(3), 2006, pp. 383-389
Induced matching extendable graph powers
Jianguo Qian
Graphs and Combinatorics
22
(3), 2006, pp. 391-398
Reconstructing under group actions
A.J. Radcliffe
,
A.D. Scott
Graphs and Combinatorics
22
(3), 2006, pp. 399-419
Minimal connected
\tau
-critical hypergraphs
Matȇj Stehlík
Graphs and Combinatorics
22
(3), 2006, pp. 421-426
A note on cyclic
m
-cycle systems of
K_{r(m)}
Shung-Liang Wu
,
Hung-Lin Fu
Graphs and Combinatorics
22
(3), 2006, pp. 427-432
A degree constraint for uniquely Hamiltonian graphs
Sarmad Abbasi
,
Asif Jamshed
Graphs and Combinatorics
22
(4), 2006, pp. 433-442
Almost symmetric cycles in large digraphs
Lech Adamus
,
A. Paweƚ Wojda
Graphs and Combinatorics
22
(4), 2006, pp. 443-452
Largest non-unique subgraphs
Lars Dvling Andersen
,
Preben Dahl Vestergaard
,
Zsott Tuza
Graphs and Combinatorics
22
(4), 2006, pp. 453-470
On the circuit-cocircuit intersection conjecture
S.R. Kingan
,
Manoel Lemos
Graphs and Combinatorics
22
(4), 2006, pp. 471-480
There exist highly critically connected graphs of diameter three
Matthias Kriesell
Graphs and Combinatorics
22
(4), 2006, pp. 481-485
Optimal
t
-edge-robust
r
-identifying codes in the king lattice
Tero Laihonen
Graphs and Combinatorics
22
(4), 2006, pp. 487-496
A characterization of graphs without even factors
Xueliang Li
,
Zhao Zhang
Graphs and Combinatorics
22
(4), 2006, pp. 497-502
Sizes of critical graphs with small maximum degrees
Xuechao Li
Graphs and Combinatorics
22
(4), 2006, pp. 503-513
\stackrel {\rightharpoonup}{C} _4
-Decompositions of
D_v \setminus P
and
D_v \bigcup P
where
P
is a 2-regular subgraph of
D_v
Liqun Pu
,
Hung-Lin Fu
,
Hao Shen
Graphs and Combinatorics
22
(4), 2006, pp. 515-525
Alternating paths along axis-parallel segments
Csaba D. Tóth
Graphs and Combinatorics
22
(4), 2006, pp. 527-543
Kite-group divisible designs of type
g^tu^1
Haiyan Wang
,
Yanxun Chang
Graphs and Combinatorics
22
(4), 2006, pp. 545-571
Seiten
<
1
2