![](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 323
Volume 323, December 2022
- Vinícius Fernandes dos Santos, Sebastián Urrutia:
Preface: LAGOS'19 - X Latin and American Algorithms, Graphs, and Optimization Symposium - Belo Horizonte, Minas Gerais, Brazil. 1 - Camila S. Araújo
, Júlio Araújo
, Ana Silva
, Alexandre A. Cezar
:
Backbone coloring of graphs with galaxy backbones. 2-13 - Júlio Araújo
, P. S. M. Arraes
:
Hull and geodetic numbers for some classes of oriented graphs. 14-27 - Julien Bensmail, Fionn Mc Inerney
, Nicolas Nisse
:
Metric dimension: From graphs to oriented graphs. 28-42 - Flavia Bonomo-Braberman
, Guillermo Durán, Nina Pardal
, Martín D. Safe
:
Forbidden induced subgraph characterization of circle graphs within split graphs. 43-75 - Flavia Bonomo-Braberman
, Fabiano de S. Oliveira
, Moysés S. Sampaio Jr.
, Jayme Luiz Szwarcfiter
:
Precedence thinness in graphs. 76-95 - Mónica Braga
, Javier Marenco
:
Facet-generating procedures for the maximum-impact coloring polytope. 96-112 - André Ebling Brondani
, Francisca Andrea Macedo França, Carla Silva Oliveira
:
Positive semidefiniteness of Aα(G) on some families of graphs. 113-123 - Márcia R. Cappelle
, Erika M. M. Coelho, Les R. Foulds, Humberto J. Longo:
Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs. 124-133 - Rafael Castro de Andrade
, Tibérius de Oliveira e Bonates, Manoel B. Campêlo
, Mardson da Silva Ferreira:
A compact quadratic model and linearizations for the minimum linear arrangement problem. 134-148 - Alexandre Santiago de Abreu, Luís Felipe I. Cunha, Celina M. H. de Figueiredo, Franklin L. Marquezino
, Daniel Posner
, Renato Portugal
:
Total tessellation cover: Bounds, hardness, and applications. 149-161 - Yingjun Dai
, Angèle M. Foley, Chính T. Hoàng
:
On coloring a class of claw-free and hole-twin-free graphs. 162-170 - Pablo De Caria
:
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs. 171-183 - Celina M. H. de Figueiredo, Alexsander Andrade de Melo
, Diana Sasaki
, Ana Silva
:
Revising Johnson's table for the 21st century. 184-200 - Alane M. de Lima
, Murilo V. G. da Silva
, André Luís Vignatti
:
Percolation centrality via Rademacher Complexity. 201-216 - Cristina G. Fernandes, Carla Negri Lintzmayer
:
Leafy spanning arborescences in DAGs. 217-227 - Gabriel Ferreira Barros, Bruno Pasqualotto Cavalar
, Guilherme Oliveira Mota
, Olaf Parczyk
:
Anti-Ramsey threshold of cycles. 228-235 - Mathew C. Francis
, Lívia Salgado Medeiros
, Fabiano de S. Oliveira
, Jayme Luiz Szwarcfiter
:
On subclasses of interval count two and on Fishburn's conjecture. 236-251 - Marina Groshaus, André Luiz Pires Guedes
, Juan Pablo Puppo:
Biclique graphs of split graphs. 252-267 - Carlos Hoppen
, Giovane Mansan:
Minimum 2-dominating sets in regular graphs. 268-285 - Ivo Koch, Javier Marenco
:
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations. 286-301 - Leandro Montero
:
Vertex removal in biclique graphs. 302-310 - Aleffer Rocha
, Sheila Morais de Almeida, Leandro M. Zatesko:
Rainbow connectivity and rainbow criticality on graph classes. 311-323 - Robert Scheffler
:
The Distance Orientation Problem. 324-342 - Sizhong Zhou:
A neighborhood union condition for fractional (a, b, k)-critical covered graphs. 343-348 - Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado
, Leandro M. Zatesko, Uéverton S. Souza
:
Compositions, decompositions, and conformability for total coloring on power of cycle graphs. 349-363
![](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.