Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 312
Volume 312, May 2022
- Robert Ganian, Jan Kratochvíl
, Stefan Szeider:
Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. 1-2 - Bogdan Alecu, Vadim V. Lozin, Dominique de Werra:
The micro-world of cographs. 3-14 - Ringi Kim, Sergey Norin, Sang-il Oum:
Obstructions for partitioning into forests and outerplanar graphs. 15-28 - Isolde Adler, Bjarki Geir Benediktsson, Dugald Macpherson:
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs. 29-44 - Jinha Kim, Minki Kim, O-joung Kwon:
Rainbow independent sets on dense graph classes. 45-51 - Flavia Bonomo-Braberman, Carolina Lucía Gonzalez, Fabiano de Souza Oliveira, Moysés S. Sampaio Jr., Jayme Luiz Szwarcfiter:
Thinness of product graphs. 52-71 - Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos:
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. 72-85 - Mitre Costa Dourado, Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Mateus de Oliveira Oliveira, Uéverton S. Souza:
Computing the zig-zag number of directed graphs. 86-105 - Ben Cameron, Chính T. Hoàng, Joe Sawada:
Dichotomizing k-vertex-critical H-free graphs for H of order four. 106-115
a service of 
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.
last updated on 2024-08-06 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
