default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 266
Volume 266, August 2019
- Irene Sciriha, Josef Lauri, John Baptist Gauci, Peter Borg
:
Preface: The Second Malta Conference in Graph Theory and Combinatorics. 1-2 - Richard A. Brualdi, Geir Dahl:
The interval structure of (0, 1)-matrices. 3-15 - Jeanette C. McLeod, Brendan D. McKay, Beáta Faller:
The r-switching-stable graphs. 16-29 - Leila Badakhshian, Gyula O. H. Katona, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube. 30-37 - Peter Dankelmann:
On average distance in tournaments and Eulerian digraphs. 38-47 - Yaser Alizadeh, Ehsan Estaji, Sandi Klavzar, Marko Petkovsek:
Metric properties of generalized Sierpiński graphs over stars. 48-55 - Izak Broere, Wilfried Imrich, Rafal Kalinowski, Monika Pilsniak:
Asymmetric colorings of products of graphs and digraphs. 56-64 - Susanna Fishel, Glenn Hurlbert, Vikram Kamat, Karen Meagher:
Erdős-Ko-Rado theorems on the weak Bruhat lattice. 65-75 - Peter Borg, Yair Caro, Kurt Fenech:
Irregular independence and irregular domination. 76-84 - Josef Lauri, Russell Mizzi, Raffaele Scapellato:
The construction of a smallest unstable asymmetric graph and a family of unstable asymmetric graphs with an arbitrarily high index of instability. 85-91 - Irene Sciriha, Luke Collins:
Two-graphs and NSSDs: An algebraic approach. 92-102 - John L. Goldwasser, Anthony J. W. Hilton, Jie Zheng:
Several families with incomparability and complementarity conditions. 103-110 - Cristina Bazgan, Henning Fernau, Zsolt Tuza:
Aspects of upper defensive alliances. 111-120 - Bart De Bruyn, Binod Kumar Sahoo, Bikramaditya Sahu:
Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3). 121-129 - Alexander Farrugia:
Edge construction of molecular NSSDs. 130-140 - Joice S. do Nascimento, Maria Aguieiras A. de Freitas, Renata R. Del-Vecchio:
The distance matrix of caterpillar. 141-152 - Afshin Behmaram, Cédric Boutillier:
Asymptotic enumeration of perfect matchings in m-barrel fullerene graphs. 153-162 - Benjamin Allgeier, Grzegorz Kubicki:
Boundary-type sets in maximal outerplanar graphs. 163-170 - Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Cyclic deficiency of graphs. 171-185 - Ingo Schiermeyer:
Maximum independent sets near the upper bound. 186-190 - Elif Saygi, Ömer Egecioglu:
Boundary enumerator polynomial of hypercubes in Fibonacci cubes. 191-199 - Raúl M. Falcón, Stephan Dominique Andres:
Autotopism stabilized colouring games on rook's graphs. 200-212 - Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez:
On the Fibonacci numbers of the composition of graphs. 213-218 - Kahina Meslem, Éric Sopena:
On the distinguishing number of cyclic tournaments: Towards the Albertson-Collins Conjecture. 219-236 - Carmen Hernando, Mercè Mora, Ignacio M. Pelayo:
Resolving dominating partitions in graphs. 237-251 - Péter L. Erdös, Michael Ferrara, Stephen G. Hartke:
Navigating between packings of graphic sequences. 252-258 - Sriparna Chattopadhyay, Kamal Lochan Patra, Binod Kumar Sahoo:
Vertex connectivity of the power graph of a finite cyclic group. 259-271 - Bart De Bruyn:
A generalization of the Haemers-Mathon bound for near hexagons. 272-282 - Angela Angeleska, Zoran Nikoloski:
Coherent network partitions. 283-290 - Johan P. de Wet, Marietjie Frick:
The Hamilton Cycle Problem for locally traceable and locally hamiltonian graphs. 291-308 - Dannielle D. D. Jin, David G. L. Wang:
On the minimum vertex cover of generalized Petersen graphs. 309-318 - Gábor Gévay:
Resolvable configurations. 319-330 - James Tuite:
On diregular digraphs with degree two and excess three. 331-339 - Ervin Györi, Gyula Y. Katona, László F. Papp:
Optimal pebbling and rubbling of graphs with given diameter. 340-345 - Yujie Gu, Ying Miao:
Union-intersection-bounded families and their applications. 346-354
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-12-19 22:14 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:
