default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 180
Volume 180, January 2015
- Mohammed Amin Abdullah, Moez Draief:
Global majority consensus by local majority polling on graphs of a given degree sequence. 1-10 - Pierre Aboulker, Nicolas Bousquet
:
Excluding cycles with a fixed number of chords. 11-24 - Attila Bernáth, Zoltán Király:
On the tractability of some natural packing, covering and partitioning problems. 25-35 - Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Helmut Prodinger:
The height and width of bargraphs. 36-44 - Zbigniew R. Bogdanowicz:
Decomposition of circulant digraphs with two jumps into cycles of equal lengths. 45-51 - Antoine Deza, Frantisek Franek, Adrien Thierry:
How many double squares can a string contain? 52-69 - Marco Di Summa, David Pritchard, Laura Sanità:
Finding the closest ultrametric. 70-80 - Frederik Garbe:
On graphs with excess or defect 2. 81-88 - Serge Gaspers, Mathieu Liedloff, Maya Jakobine Stein, Karol Suchan:
Complexity of splits reconstruction for low-degree trees. 89-100 - Petr A. Golovach, Daniël Paulusma, Bernard Ries:
Coloring graphs characterized by a forbidden subgraph. 101-110 - Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the number of optimal identifying codes in a twin-free graph. 111-119 - Seog-Jin Kim, Young Soo Kwon, Boram Park:
Chromatic-choosability of the power of graphs. 120-125 - Chia-Wei Lee, Pin-Liang Chen, Sun-Yuan Hsieh:
Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths. 126-134 - Shmuel Onn, Vladimir A. Shlyk:
Some efficiently solvable problems over integer partition polytopes. 135-140 - István Szalkai, Zsolt Tuza:
Minimum number of affine simplices of given dimension. 141-149 - Lutz Volkmann:
The signed Roman k-domatic number of a graph. 150-157 - Donald K. Wagner:
Delta-wye reduction of almost-planar graphs. 158-167 - Shaohui Wang, Bing Wei:
Multiplicative Zagreb indices of k-trees. 168-175
- Noureddine Ikhlef Eschouf, Mostafa Blidia, Frédéric Maffray:
On edge-b-critical graphs. 176-180 - Jithin Mathews, Manas Kumar Panda, Saswata Shannigrahi:
On the construction of non-2-colorable uniform hypergraphs. 181-187 - Abbas Mehrabian:
The fast robber on interval and chordal graphs. 188-193 - Long Wang, Yi-Zheng Fan, Yi Wang:
Maximum Estrada index of bicyclic graphs. 194-199 - Zhidan Yan, Wei Wang, Xin Zhang:
Equitable colorings of Cartesian products with balanced complete multipartite graphs. 200-203
- Jeremy F. Alm, Jacob Manske:
Sum-free cyclic multi-bases and constructions of Ramsey algebras. 204-212
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-27 22:45 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:
