default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 54
Volume 54, October 2016
- Anna de Mier, Oriol Serra:
Preface. 1-2 - Ljuben R. Mutafchiev:
On the Distribution of the Number of Goldbach Partitions of a Randomly Chosen Positive Even Integer. 3-8 - Yonah Biers-Ariel, Anant P. Godbole, Yiguang Zhang:
Preferential Arrangement Superpatterns. 9-14 - Reshma Ramadurai, Nicholas J. Cavenagh:
On the distances between Latin squares and the smallest defining set size. 15-20 - Jean-Paul Doignon:
A Convex Polytope and an Antimatroid for any Given, Finite Group. 21-25 - T. S. Michael, Val Pinciu:
The Orthogonal Art Gallery Theorem with Constrained Guards. 27-32 - Ron Aharoni, Eli Berger, Dani Kotlar
, Ran Ziv:
On rainbow matchings in bipartite graphs. 33-38 - Sahar A. Aleid, José Cáceres, María Luz Puertas:
Independent [1, 2]-domination of grids via min-plus algebra. 39-44 - Vadim E. Levit, Eugen Mandrescu:
Crowns in bipartite graphs. 45-50 - Tomoki Nakamigawa:
Enumeration Problems on the Expansion of a Chord Diagram. 51-56 - Anurag Bishnoi, Pete L. Clark, Aditya Potukuchi, John R. Schmitt:
On the Alon-Füredi bound. 57-62 - David Orden, Ivan Marsá-Maestre, José Manuel Giménez-Guzmán, Enrique de la Hoz:
Bounds on spectrum graph coloring. 63-68 - Diego González-Moreno, Camino Balbuena, Mika Olsen:
Vertex-disjoint cycles in bipartite tournaments. 69-72 - Andrei Asinowski, Christian Krattenthaler, Toufik Mansour:
Counting triangulations of balanced subdivisions of convex polygons. 73-78 - Ravindra B. Bapat, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Tadashi Sakuma, Zsolt Tuza:
Network Majority on Tree Topological Network. 79-84 - Susana Furtado, Charles R. Johnson, Carlos Marijuán, Miriam Pisonero:
Comparison on the spectral radii of weighted digraphs that differ in a certain subdigraph. 85-90 - Carlos Marijuán, J. García-López, Luis Miguel Pozo Coronado:
Structural and spectral properties of minimal strong digraphs. 91-96 - Mark Dukes, Thomas Selig:
Decomposing recurrent states of the abelian sandpile model. 97-102 - Shinya Fujita, Henry Liu, Amites Sarkar:
Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract). 103-108 - Santiago Canales, Irene Castro, Gregorio Hernández-Peñalver, Ana Mafalda Martins:
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs. 109-114 - Mariusz Grech, Andrzej Kisielewicz:
Černý conjecture for edge-colored digraphs with few junctions. 115-120 - Tien-Nam Le, Paul Wollan:
Forcing clique immersions through chromatic number. 121-126 - Gábor Wiener:
On constructions of hypotraceable graphs. 127-132 - Mónica Blanco, Francisco Santos:
Enumerating lattice 3-polytopes. 133-138 - Encarnación Abajo, Gabriela Araujo-Pardo, Camino Balbuena, Manuel Bendala:
New family of small regular graphs of girth 5. 139-144 - Nacho López, Hebert Pérez-Rosés, Jordi Pujolàs:
A Moore-like bound for mixed abelian Cayley graphs. 145-150 - Nacho López, Hebert Pérez-Rosés, Jordi Pujolàs, Mária Zdímalová:
A variant of the McKay-Miller-Širáň construction for mixed graphs. 151-156 - Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing. 157-162 - José Cáceres, Delia Garijo, Auxiliadora Moreno-González, Alberto Márquez, María Luz Puertas, Paula Ribeiro:
Shortcut sets for plane Euclidean networks (Extended abstract). 163-168 - Herbert Edelsbrunner, Mabel Iglesias Ham:
Multiple Covers with Balls II: Weighted Averages. 169-174 - Bruno D. Amaro, Leonardo Silva de Lima, Carla Silva Oliveira, Carlile Lavor, Nair Abreu:
A note on the sum of the largest signless Laplacian eigenvalues. 175-180 - Dennis Clemens, Julia Ehrenmüller, Yury Person:
A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. 181-186 - Cesar Ceballos, Arnau Padrol, Camilo Sarmiento:
Tropical Catalan subdivisions. 187-192 - Pilar Cano, Guillem Perarnau, Oriol Serra:
Rainbow perfect matchings in r-partite graph structures. 193-198 - Bostjan Bresar, Tim Kos, Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. 199-204 - Xavier Molinero, Maria J. Serna:
The Complexity of Measuring Power in Generalized Opinion Leader Decision Models. 205-210 - Marc Noy, Clément Requilé, Juanjo Rué:
Random cubic planar graphs revisited. 211-216 - Francisco Criado, Francisco Santos:
The maximum diameter of pure simplicial complexes and pseudo-manifolds. 217-221 - Sergio Cabello, Miha Jejcic:
Refining the Hierarchies of Classes of Geometric Intersection Graphs. 223-228 - Silvia Gago:
Kirchhoff index of a non-complete wheel. 229-234 - Gabriela Araujo-Pardo, Camino Balbuena, Mirka Miller, Mária Zdímalová:
A construction of dense mixed graphs of diameter 2. 235-240 - M. P. Revuelta, Luis Boza, Juan Manuel Marín, María Isabel Sanz Domínguez:
Exact value of 3 color weak Rado number. 241-245 - Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva:
Construction and classification of Z2s-linear Hadamard codes. 247-252 - Christian Rubio-Montiel, Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño:
The achromatic number of Kneser graphs. 253-258 - Henning Bruhn, Laura Gellert, Richard Lang:
Chromatic index, treewidth and maximum degree. 259-264 - Mucuy-kak Guevara, Camino Balbuena, Hortensia Galeana-Sánchez:
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs. 265-269 - David E. Roberson:
Homomorphisms of Strongly Regular Graphs. 271-276 - Francesc Aguiló, Miguel Angel Fiol, Sonia Pérez:
A geometric approach to dense Cayley digraphs of finite Abelian groups. 277-282 - Roland D. Barrolleta, Jaume Pujol, Mercè Villanueva:
Comparing decoding methods for quaternary linear codes. 283-288 - Pedro García-Vázquez:
On the bipartite vertex frustration of graphs. 289-294 - Ángeles Carmona, Margarida Mitjana, Eduard Monso:
The group inverse of subdivision networks. 295-300 - Clemens Huemer, Carlos Seara, Rodrigo I. Silveira, Alexander Pilz:
Production matrices for geometric graphs. 301-306 - Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov, Eduard Vatutin:
On the Construction of Triples of Diagonal Latin Squares of Order 10. 307-312 - María José Jiménez, Andrés M. Encinas:
Combinatorial Recurrences and Linear Difference Equations. 313-318 - Iván Bailera, Joaquim Borges, Josep Rifà:
About some Hadamard full propelinear (2t, 2, 2)-codes. Rank and Kernel. 319-324 - Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht, Jakob Schnitzer, Fabian Schulenburg:
Loose Hamiltonian cycles forced by (k - 2)-degree - approximate version. 325-330 - Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci:
Edge Monitoring Problem on Interval Graphs. 331-336 - Ainara Mira-Iglesias, J. Alberto Conejero, Esperanza Navarro-Pardo:
Natural visibility graphs for diagnosing attention deficit hyperactivity disorder (ADHD). 337-342 - Lluís Vena:
On limits of sparse random graphs. 343-348 - Josep M. Brunat, Montserrat Maureso:
Extreme Weights in Steinhaus Triangles. 349-354 - Tamás Hubai, Dávid Kunszenti-Kovács, László Lovász:
Positive graphs. 355-360 - Zsófia R. Kereskényiné Balogh, Michael J. Schlosser:
q-Stirling numbers of the second kind and q-Bell numbers for graphs. 361-366
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 2025-02-20 19:37 CET 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:
