![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 281
Volume 281, July 2020
- Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon:
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. 1 - Liliana Alcón, Miguel A. Pizaña, Gabriela Ravenna:
Two infinite families of critical clique-Helly graphs. 2-5 - Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Katrin Wagler:
Linear-time algorithms for three domination-based separation problems in block graphs. 6-41 - Flavia Bonomo-Braberman
, Guillermo Durán, Martín D. Safe
, Annegret Katrin Wagler:
On some graph classes related to perfect graphs: A survey. 42-60 - Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Constant threshold intersection graphs of orthodox paths in trees. 61-68 - Mónica Braga
, Diego Delle Donne
, Mariana S. Escalante, Javier Marenco, María Elisa Ugarte, María del Carmen Varaldo:
The minimum chromatic violation problem: A polyhedral approach. 69-80 - Andreas Brandstädt, Raffaele Mosca:
On efficient domination for some classes of H-free chordal graphs. 81-95 - Márcia R. Cerioli, Paloma T. Lima:
Intersection of longest paths in graph classes. 96-105 - Nathan Chadder, Antoine Deza
:
Computational determination of the largest lattice polytope diameter. 106-110 - Fernando Esteban Contreras-Mendoza
, César Hernández-Cruz
:
Minimal obstructions to (s, 1)-polarity in cographs. 111-117 - Fernanda Couto
, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Vinícius Fernandes dos Santos
:
Characterizations, probe and sandwich problems on (k, ℓ)-cographs. 118-133 - Edmilson Pereira da Cruz, Marina Groshaus, André Luiz Pires Guedes
, Juan Pablo Puppo
:
Biclique graphs of interval bigraphs. 134-143 - Simone Dantas
, Rodrigo Marinho
, Slobodan Tanushevski
:
The Solitaire Clobber game and correducibility of graphs. 144-150 - Pablo De Caria:
Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs. 151-161 - Celina M. H. de Figueiredo
:
Complexity-separating graph classes for vertex, edge and total colouring. 162-171 - Murilo Santos de Lima, Mário César San Felice
, Orlando Lee:
Group parking permit problems. 172-194 - Renata R. Del-Vecchio
, Cybele T. M. Vinagre
, Guilherme B. Pereira:
On hyper-Hamiltonicity in graphs. 195-202 - Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, Alexandru Popa
:
On the (di)graphs with (directed) proper connection number two. 203-215 - Stefan Ehard, Dieter Rautenbach:
Approximating connected safe sets in weighted trees. 216-223 - Dror Epstein, Martin Charles Golumbic, Abhiruk Lahiri, Gila Morgenstern:
Hardness and approximation for L-EPG and B1-EPG graphs. 224-228 - Luérbio Faria, Sulamita Klein, Ignasi Sau
, Uéverton S. Souza
, Rubens Sucupira:
Maximum cuts in edge-colored graphs. 229-234 - Tomás Feder, Pavol Hell:
Complexity of correspondence H-colourings. 235-245 - Martín Matamala, José Zamora:
Graphs admitting antimagic labeling for arbitrary sets of positive numbers. 246-251 - Phablo F. S. Moura
, Yoshiko Wakabayashi
:
Strong intractability results for generalized convex recoloring problems. 252-260 - Miguel A. Pizaña, I. A. Robles
:
On bicliques and the second clique graph of suspensions. 261-267 - Leandro M. Zatesko, Alesom Zorzi, Renato Carmo, André Luiz Pires Guedes
:
Edge-colouring graphs with bounded local degree sums. 268-283
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.