| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Approximating connected safe sets in weighted trees
|
Ehard, Stefan
|
|
|
281 |
C |
p. 216-223
|
article
|
| 2 |
Biclique graphs of interval bigraphs
|
Cruz, E.P.
|
|
|
281 |
C |
p. 134-143
|
article
|
| 3 |
Characterizations, probe and sandwich problems on ( k , ℓ ) -cographs
|
Couto, Fernanda
|
|
|
281 |
C |
p. 118-133
|
article
|
| 4 |
Complexity of correspondence H -colourings
|
Feder, Tomás
|
|
|
281 |
C |
p. 235-245
|
article
|
| 5 |
Complexity-separating graph classes for vertex, edge and total colouring
|
de Figueiredo, Celina M.H.
|
|
|
281 |
C |
p. 162-171
|
article
|
| 6 |
Computational determination of the largest lattice polytope diameter
|
Chadder, Nathan
|
|
|
281 |
C |
p. 106-110
|
article
|
| 7 |
Constant threshold intersection graphs of orthodox paths in trees
|
Bornstein, Claudson Ferreira
|
|
|
281 |
C |
p. 61-68
|
article
|
| 8 |
Edge-colouring graphs with bounded local degree sums
|
Zatesko, L.M.
|
|
|
281 |
C |
p. 268-283
|
article
|
| 9 |
Editorial Board
|
|
|
|
281 |
C |
p. ii
|
article
|
| 10 |
Graphs admitting antimagic labeling for arbitrary sets of positive numbers
|
Matamala, Martín
|
|
|
281 |
C |
p. 246-251
|
article
|
| 11 |
Group parking permit problems
|
de Lima, Murilo Santos
|
|
|
281 |
C |
p. 172-194
|
article
|
| 12 |
Hardness and approximation for L-EPG and B 1 -EPG graphs
|
Epstein, Dror
|
|
|
281 |
C |
p. 224-228
|
article
|
| 13 |
Intersection of longest paths in graph classes
|
Cerioli, Márcia R.
|
|
|
281 |
C |
p. 96-105
|
article
|
| 14 |
Linear-time algorithms for three domination-based separation problems in block graphs
|
Argiroffo, Gabriela R.
|
|
|
281 |
C |
p. 6-41
|
article
|
| 15 |
Maximum cuts in edge-colored graphs
|
Faria, Luerbio
|
|
|
281 |
C |
p. 229-234
|
article
|
| 16 |
Minimal obstructions to ( s , 1 ) -polarity in cographs
|
Contreras-Mendoza, Fernando Esteban
|
|
|
281 |
C |
p. 111-117
|
article
|
| 17 |
Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs
|
De Caria, Pablo
|
|
|
281 |
C |
p. 151-161
|
article
|
| 18 |
On bicliques and the second clique graph of suspensions
|
Pizaña, M.A.
|
|
|
281 |
C |
p. 261-267
|
article
|
| 19 |
On efficient domination for some classes of H -free chordal graphs
|
Brandstädt, Andreas
|
|
|
281 |
C |
p. 81-95
|
article
|
| 20 |
On hyper-Hamiltonicity in graphs
|
Del-Vecchio, Renata R.
|
|
|
281 |
C |
p. 195-202
|
article
|
| 21 |
On some graph classes related to perfect graphs: A survey
|
Bonomo-Braberman, Flavia
|
|
|
281 |
C |
p. 42-60
|
article
|
| 22 |
On the (di)graphs with (directed) proper connection number two
|
Ducoffe, Guillaume
|
|
|
281 |
C |
p. 203-215
|
article
|
| 23 |
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. – Marseille, France, 2017
|
Bassino, Frédérique
|
|
|
281 |
C |
p. 1
|
article
|
| 24 |
Strong intractability results for generalized convex recoloring problems
|
Moura, Phablo F.S.
|
|
|
281 |
C |
p. 252-260
|
article
|
| 25 |
The minimum chromatic violation problem: A polyhedral approach
|
Braga, M.
|
|
|
281 |
C |
p. 69-80
|
article
|
| 26 |
The Solitaire Clobber game and correducibility of graphs
|
Dantas, Simone
|
|
|
281 |
C |
p. 144-150
|
article
|
| 27 |
Two infinite families of critical clique–Helly graphs
|
Alcón, Liliana
|
|
|
281 |
C |
p. 2-5
|
article
|
Journal description