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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recent advances on the Hamiltonian problem: Survey III
Ronald J. Gould
Graphs and Combinatorics
30
(1), 2014, pp. 1-46
Plane graphs with parity constraints
Oswin Aichholzer
,
Thomas Hackl
,
Michael Hoffmann
,
Alexander Pilz
,
Günter Rote
,
Bettina Speckmann
,
Birgit Vogtenhuber
Graphs and Combinatorics
30
(1), 2014, pp. 47-69
On the chromatic number of subsets of the Euclidean plane
M. Axenovich
,
J. Choi
,
M. Lastrina
,
T. McKay
,
J. Smith
,
B. Stanton
Graphs and Combinatorics
30
(1), 2014, pp. 71-81
On the broadcast independence number of grid graph
Isma Bouchemakh
,
Mohamed Zemir
Graphs and Combinatorics
30
(1), 2014, pp. 83-100
Size-maximal symmetric difference-free families of subsets of
[n]
Travis G. Buck
,
Anant P. Godbole
Graphs and Combinatorics
30
(1), 2014, pp. 101-108
Extremal Zagreb indices of graphs with a given number of cut edges
Shubo Chen
,
Weijun Liu
Graphs and Combinatorics
30
(1), 2014, pp. 109-118
A note on the Cops and Robber game on graphs embedded in non-orientable surfaces
Nancy E. Clarke
,
Samuel Fiorini
,
Gwenaël Joret
,
Dirk Oliver Theis
Graphs and Combinatorics
30
(1), 2014, pp. 119-124
Unfolding orthogonal polyhedra with quadratic refinement: The delta-unfolding algorithm
Mirela Damian
,
Erik D. Demaine
,
Robin Flatland
Graphs and Combinatorics
30
(1), 2014, pp. 125-140
On the spectrum of minimal defining sets of full designs
Fatih Demirkale
,
Emine Şule Yazıcı
Graphs and Combinatorics
30
(1), 2014, pp. 141-157
A note on counting homomorphisms of paths
Roger B. Eggleton
,
Michaƚ Morayne
Graphs and Combinatorics
30
(1), 2014, pp. 159-170
Zero divisors among digraphs
Richard Hammack
,
Heather Smith
Graphs and Combinatorics
30
(1), 2014, pp. 171-181
d
-strong edge colorings of graphs
Arnfried Kemnitz
,
Massimiliano Marangio
Graphs and Combinatorics
30
(1), 2014, pp. 183-195
Stability number and f-factors in graphs
Mekkia Kouider
Graphs and Combinatorics
30
(1), 2014, pp. 197-202
Tight relative 2- and 4-designs on binary Hamming association schemes
Zengti Li
,
Eiichi Bannai
,
Etsuko Bannai
Graphs and Combinatorics
30
(1), 2014, pp. 203-227
On perfect
k
-matchings
Hongliang Lu
,
Wei Wang
Graphs and Combinatorics
30
(1), 2014, pp. 229-235
The connected monophonic number of a graph
P. Titus
,
K. Ganesamoorthy
Graphs and Combinatorics
30
(1), 2014, pp. 237-245
Some graphs with double domination subdivision number three
Haoli Wang
,
Xirong Xu
,
Yuansheng Yang
,
Baosheng Zhang
Graphs and Combinatorics
30
(1), 2014, pp. 247-251
Erratum to ``Some graphs with double domination subdivision number three''
Haoli Wang
,
Xirong Xu
,
Yuansheng Yang
,
Baosheng Zhang
Graphs and Combinatorics
30
(1), 2014, pp. 253-253
Representing graphs in Steiner triple systems
Dan Archdeacon
,
Terry Griggs
,
Costas Psomas
Graphs and Combinatorics
30
(2), 2014, pp. 255-266
Maximum hitting for
n
sufficiently large
Ben Barber
Graphs and Combinatorics
30
(2), 2014, pp. 267-274
Rainbow connection number and radius
Manu Basavaraju
,
L. Sunil Chandran
,
Deepak Rajendraprasad
,
Arunselvan Ramaswamy
Graphs and Combinatorics
30
(2), 2014, pp. 275-285
Chromatic polynomials of complements of bipartite graphs
Adam Bohn
Graphs and Combinatorics
30
(2), 2014, pp. 287-301
On the minimum sum coloring of
P_4
-sparse graphs
Flavia Bonomo
,
Mario Valencia-Pabon
Graphs and Combinatorics
30
(2), 2014, pp. 303-314
The Steiner problem on surfaces of revolution
Elena A. Caffarelli
,
Denise M. Halverson
,
Ryan J. Jensen
Graphs and Combinatorics
30
(2), 2014, pp. 315-342
Special eccentric vertices for the class of chordal graphs and related classes
Pablo De Caria
,
Marisa Gutierrez
Graphs and Combinatorics
30
(2), 2014, pp. 343-352
Seiten 1
2
3
4
5
>