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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The signless Laplacian spectral radius of graphs with given number of pendant vertices
Yi-Zheng Fan
,
Dan Yang
Graphs and Combinatorics
25
(3), 2009, pp. 291-298
Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic
Jinfeng Feng
Graphs and Combinatorics
25
(3), 2009, pp. 299-307
Maximum orbit weights in the
\sigma
-game and lit-only
\sigma
-game on grids and graphs
John L. Goldwasser
,
William F. Klostermeyer
Graphs and Combinatorics
25
(3), 2009, pp. 309-326
On polygons enclosing point sets II
F. Hurtado
,
C. Merino
,
D. Oliveros
,
T. Sakai
,
J. Urrutia
,
I. Ventura
Graphs and Combinatorics
25
(3), 2009, pp. 327-339
Total restrained domination in cubic graphs
Hongxing Jiang
,
Liying Kang
,
Erfang Shan
Graphs and Combinatorics
25
(3), 2009, pp. 341-350
On geometric graph Ramsey numbers
Gyula Károlyi
,
Vera Rosta
Graphs and Combinatorics
25
(3), 2009, pp. 351-363
On b-perfect chordal graphs
Frédéric Maffray
,
Meriem Mechebbek
Graphs and Combinatorics
25
(3), 2009, pp. 365-375
Longest cycles in 3-connected graphs with given independence number
Y. Manoussakis
Graphs and Combinatorics
25
(3), 2009, pp. 377-384
Small cycle double covers of products II: Categorical and strong products with paths and cycles
R.J. Nowakowski
,
K. Seyffarth
Graphs and Combinatorics
25
(3), 2009, pp. 385-400
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Lan Shen
,
Yingqian Wang
Graphs and Combinatorics
25
(3), 2009, pp. 401-407
Grid graphs, Gorenstein polytopes, and domino stackings
Matthias Beck
,
Christian Haase
,
Steven V Sam
Graphs and Combinatorics
25
(4), 2009, pp. 409-426
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
Hajo Broersma
,
Daniël Paulusma
,
Kiyoshi Yoshimoto
Graphs and Combinatorics
25
(4), 2009, pp. 427-460
Induced-universal graphs for graphs with bounded maximum degree
Steve Butler
Graphs and Combinatorics
25
(4), 2009, pp. 461-468
A description of the resonance variety of a line combinatorics via combinatorial pencils
Miguel Ángel Marco Buzunáriz
Graphs and Combinatorics
25
(4), 2009, pp. 469-488
The four-in-a-tree problem in triangle-free graphs
Nicolas Derhy
,
Christophe Picouleau
,
Nicolas Trotignon
Graphs and Combinatorics
25
(4), 2009, pp. 489-502
Paired-domination subdivision numbers of graphs
O. Favaron
,
H. Karami
,
S.M. Sheikholeslami
Graphs and Combinatorics
25
(4), 2009, pp. 503-512
Upper bounds for
\alpha
-domination parameters
Andrei Gagarin
,
Anush Poghosyan
,
Vadim Zverovich
Graphs and Combinatorics
25
(4), 2009, pp. 513-520
Minimum cost homomorphism dichotomy for oriented cycles
Gregory Gutin
,
Arash Rafiey
,
Anders Yeo
Graphs and Combinatorics
25
(4), 2009, pp. 521-531
Fast winning strategies in avoider-enforcer games
Dan Hefetz
,
Michael Krivelevich
,
Milos̑ Stojaković
,
Tibor Szabó
Graphs and Combinatorics
25
(4), 2009, pp. 533-544
Building graphs whose independence polynomials have only real roots
Eugen Mandrescu
Graphs and Combinatorics
25
(4), 2009, pp. 545-556
On the structure of contractible edges in
k
-connected partial
k
-trees
N.S. Narayanaswamy
,
N. Sadagopan
,
L. Sunil Chandran
Graphs and Combinatorics
25
(4), 2009, pp. 557-569
Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs
P. Paulraja
,
S. Sivasankar
Graphs and Combinatorics
25
(4), 2009, pp. 571-581
On substructure densities of hypergraphs
Yuejian Peng
Graphs and Combinatorics
25
(4), 2009, pp. 583-600
Subgraph transversal of graphs
Jia Shen
Graphs and Combinatorics
25
(4), 2009, pp. 601-609
Competition hypergraphs of products of digraphs
Martin Sonntag
,
Hans-Martin Teichery
Graphs and Combinatorics
25
(4), 2009, pp. 611-624
Seiten
<
1
2
3
>