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=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on the Roman bondage number of planar graphs
Saieed Akbari
,
Mahdad Khatirinejad
,
Sahar Qajar
Graphs and Combinatorics
29
(3), 2013, pp. 327-331
Watching systems in the king grid
David Auger
,
Iiro Honkala
Graphs and Combinatorics
29
(3), 2013, pp. 333-347
Kings in hypertournaments
Dejan Brcanov
,
Vojislav Petrovic
,
Miroslav Treml
Graphs and Combinatorics
29
(3), 2013, pp. 349-357
Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
Arthur H. Busch
,
Michael S. Jacobson
,
Timothy Morris
,
Michael J. Plantholt
,
Shailesh K. Tipnis
Graphs and Combinatorics
29
(3), 2013, pp. 359-364
Improvement on the decay of crossing numbers
Jakub C̑erný
,
Jan Kync̑l
,
Géza Tóth
Graphs and Combinatorics
29
(3), 2013, pp. 365-371
The linear arboricity of planar graphs without 5-, 6-cycles with chords
Hongyu Chen
,
Xiang Tan
,
Jianliang Wu
,
Guojun Li
Graphs and Combinatorics
29
(3), 2013, pp. 373-385
On zero-sum
\mathbb Z_k
-magic labelings of 3-regular graphs
Jeong-Ok Choi
,
J.P. Georges
,
David Mauro
Graphs and Combinatorics
29
(3), 2013, pp. 387-398
Two-character sets arising from gluings of orbits
Antonio Cossidente
,
Tim Penttila
Graphs and Combinatorics
29
(3), 2013, pp. 399-406
An excursion into nonlinear Ramsey theory
Adam Doss
,
Dan Saracino
,
Donald L., Jr. Vestal
Graphs and Combinatorics
29
(3), 2013, pp. 407-415
Boxicity of graphs on surfaces
Louis Esperet
,
Gwenaël Joret
Graphs and Combinatorics
29
(3), 2013, pp. 417-427
Saturation numbers for nearly complete graphs
Ralph J. Faudree
,
Ronald J. Gould
Graphs and Combinatorics
29
(3), 2013, pp. 429-448
Degree distance of unicyclic graphs with given matching number
Lihua Feng
,
Weijun Liu
,
Aleksandar Ilić
,
Guihai Yu
Graphs and Combinatorics
29
(3), 2013, pp. 449-462
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
Florent Foucaud
,
Reza Naserasr
,
Aline Parreau
Graphs and Combinatorics
29
(3), 2013, pp. 463-473
On parsimonious edge-colouring of graphs with maximum degree three
J.-L. Fouquet
,
J.-M. Vanherpe
Graphs and Combinatorics
29
(3), 2013, pp. 475-487
Almost cross-intersecting and almost cross-Sperner pairs of families of sets
Dániel Gerbner
,
Nathan Lemons
,
Cory Palmer
,
Dömötör Pálvölgyi
,
Balázs Patkós
,
Vajk Szécsi
Graphs and Combinatorics
29
(3), 2013, pp. 489-498
On the intersection graphs of orthogonal line segments in the plane: Characterizations of some subclasses of chordal graphs
M.C. Golumbic
,
B. Ries
Graphs and Combinatorics
29
(3), 2013, pp. 499-517
On graphs having maximal independent sets of exactly
t
distinct cardinalities
Bert L. Hartnell
,
Douglas F. Rall
Graphs and Combinatorics
29
(3), 2013, pp. 519-525
Roman domination dot-critical graphs
Nader Jafari Rad
,
Lutz Volkmann
Graphs and Combinatorics
29
(3), 2013, pp. 527-533
Bounds on the rubbling and optimal rubbling numbers of graphs
Gyula Y. Katona
,
Nándor Sieben
Graphs and Combinatorics
29
(3), 2013, pp. 535-551
Recognizing well covered graphs of families with special
P_4
-components
S. Klein
,
C.P. de Mello
,
A. Morgana
Graphs and Combinatorics
29
(3), 2013, pp. 553-567
Arc-transitive dihedrants of odd prime-power order
István Kovács
Graphs and Combinatorics
29
(3), 2013, pp. 569-583
On group choosability of total graphs
H.J. Lai
,
G.R. Omidi
,
G. Raeisi
Graphs and Combinatorics
29
(3), 2013, pp. 585-597
Tank-ring factors in supereulerian claw-free graphs
MingChu Li
,
Lifeng Yuan
,
He Jiang
,
Bing Liu
,
H.J. Broersma
Graphs and Combinatorics
29
(3), 2013, pp. 599-608
Nowhere-zero 5-flows and even (1,2)-factors
M. Matamala
,
J. Zamora
Graphs and Combinatorics
29
(3), 2013, pp. 609-616
Ehrhart series for connected simple graphs
Tetsushi Matsui
Graphs and Combinatorics
29
(3), 2013, pp. 617-635
Seiten
<
1
2
3
4
5
6
7
>