![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Electronic Notes in Discrete Mathematics, Volume 68
Volume 68, July 2018
- Delia Garijo
, Alberto Márquez
, Oriol Serra:
Preface. 1-3 - Andrew Vince
, Michael F. Barnsley:
Self-Similar Polygonal Tiling: extended abstract. 5-10 - Simeon Ball
, Bence Csajbók
:
On Segre's Lemma of Tangents. 11-16 - Javier Cilleruelo, Oriol Serra, Maximilian Wötzel
:
Set systems with distinct sumsets. 17-22 - Shunsuke Nakamura, Yoshimi Egawa, Keiko Kotani:
Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph. 23-28 - David J. Grynkiewicz:
Iterated Sumsets and Olson's Generalization of the Erdős-Ginzburg-Ziv Theorem. 29-34 - Vadim E. Levit
, Eugen Mandrescu:
Graph Operations Preserving W2-Property. 35-40 - Mariusz Grech
, Andrzej Kisielewicz
:
Cyclic Automorphism Groups of Graphs and Edge-Colored Graphs. 41-46 - Omar Alomari
, Mohammad Abudayah
, Torsten Sander:
Integral Free-Form Sudoku graphs. 47-52 - Eiran Danan, Raúl M. Falcón
, Dani Kotlar
, Trent G. Marbach
, Rebecca J. Stones:
Two-line graphs of partial Latin rectangles. 53-58 - Atsuhiro Nakamoto, Gen Kawatani, Naoki Matsumoto, Jorge Urrutia:
Geometric quadrangulations of a polygon. 59-64 - Mario Huicochea:
Sums of finite subsets in Rd. 65-69 - Tobias Müller, Marc Noy:
The first order convergence law fails for random perfect graphs. 71-76 - Santiago Canales, Irene Castro, Gregorio Hernández-Peñalver
:
Combinatorial bounds on paired and multiple domination in triangulations. 77-82 - Mariusz Grech
, Andrzej Kisielewicz
:
2-closed abelian permutation groups. 83-88 - Rocío González-Díaz, Eduardo Paluzo-Hidalgo
, Miguel Angel Gutiérrez-Naranjo
:
Representative datasets for neural networks. 89-94 - Carlos Marijuán
, Miriam Pisonero:
On spectra of weighted graphs of order ≤5. 95-100 - Juanjo Rué, Christoph Spiegel:
On a problem of Sárközy and Sós for multivariate linear forms. 101-106 - Snjezana Majstorovic, Martin Knor, Riste Skrekovski
:
Graphs preserving total distance upon vertex removal. 107-112 - Nieves Atienza
, Rocío González-Díaz, M. Soriano-Trigueros
:
A new entropy based summary function for topological data analysis. 113-118 - Juanjo Rué, Dimitrios M. Thilikos, Vasiliki Velona:
Structure and Enumeration of K4-minor-free links and link diagrams. 119-124 - José Manuel Jiménez Cobano, José María Ucha-Enríquez:
Finding multiplies solutions for non-linear integer programming. 125-130 - Carmen Hernando
, Mercè Mora
, Ignacio M. Pelayo, Liliana Alcón, Marisa Gutierrez:
Neighbor-locating coloring: graph operations and extremal cardinalities. 131-136 - Luis Boza, M. P. Revuelta
, María Isabel Sanz Domínguez
:
A general lower bound on the weak Schur number. 137-142 - Alfredo Hubard, Arnau Padrol:
Stabbing convex subdivisions with k-flats. 143-148 - Víctor Álvarez
, José Andrés Armario, María Dolores Frau, Félix Gudiel, María-Belén Güemes
, Elena Martín, Amparo Osuna:
GA Based Robust Blind Digital Watermarking. 149-154 - Óscar Iglesias Valiño, Francisco Santos
:
The complete classification of empty lattice 4-simplices. 155-160 - Justo Puerto, Moisés Rodríguez-Madrena:
A discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric. 161-165 - Marthe Bonamy, Nicolas Bousquet
, Guillem Perarnau
:
Frozen colourings of bounded degree graphs. 167-172 - Elena Cabrera Revuelta
, María José Chávez de Diego
, Alberto Márquez Pérez
:
The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application. 173-178 - Alberto Espuny Díaz
, Oriol Serra:
Entropy versions of additive inequalities. 179-184 - José Aliste-Prieto, José Zamora, Anna de Mier:
On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs. 185-190 - Pedro Martín
, Diego Yáñez:
Some clustering algorithms in normed planes. 191-196 - Xavier Molinero
, Fabián Riquelme
, Maria J. Serna:
Satisfaction and Power in Unanimous Majority Influence Decision Models. 197-202 - Jesús Lacalle, Luis Miguel Pozo Coronado
:
Variance of the sum of independent random variables in spheres. 203-208 - Jesús Lacalle, Laura N. Gatti
:
Extended Lagrange's four-square theorem. 209-214 - Guillermo Esteban
, Clemens Huemer
, Rodrigo I. Silveira
:
New results on production matrices for geometric graphs. 215-220 - Jie Han, Yoshiharu Kohayakawa, Yury Person
:
Near-perfect clique-factors in sparse pseudorandom graphs. 221-226 - Bart Litjens, Sven C. Polak
, Bart Sevenster, Lluís Vena
:
On the chromatic number of a subgraph of the Kneser graph. 227-232 - Stephan Dominique Andres, Helena Bergold, Raúl M. Falcón
:
Autoparatopism stabilized colouring games on rook's graphs. 233-238 - Pietro Codara
, Ottavio M. D'Antona:
Dyck-Eulerian digraphs. 239-244 - Encarnación Abajo, Camino Balbuena, Manuel Bendala:
Elliptic semiplanes and regular graphs with girth 5. 245-250 - Yannis Manoussakis, Hong Phong Pham:
Maximum colorful independent sets in vertex-colored graphs. 251-256 - Gonzalo Fiz Pontiveros, Roman Glebov, Ilan Karpas:
Virtually Fibering Random Right-Angled Coxeter Groups - Extended Abstract. 257-261 - Jan Bok
, Jaroslav Nesetril:
Graph-indexed random walks on pseudotrees. 263-268 - Rui Duarte
, António Guedes de Oliveira
:
Hyperplane arrangements between Shi and Ish. 269-274 - Konstantinos Papalamprou:
On characterizing the extreme points of the generalized transitive tournament polytope. 275-280 - Yulia Kempner, Vadim E. Levit
:
Krein-Milman Spaces. 281-286 - Silvia Gago:
Kirchhoff index of the connections of two networks by an edge. 287-292 - Aida Abiad:
A characterization of weight-regular partitions of graphs. 293-298 - David Iglesias:
On the discrete Brunn-Minkowski inequality by Gradner&Gronchi. 299-304 - Javier Rodrigo
, M. Dolores López:
An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points. 305-310
![](https://dblp.dagstuhl.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.