default search action
Discrete Applied Mathematics, Volume 184
Volume 184, March 2015
- Sylvain Béal, Eric Rémila, Philippe Solal:
A decomposition of the space of TU-games using addition and transfer invariance. 1-13 - Vítor Costa, Simone Dantas, Dieter Rautenbach:
Asymptotic surviving rate of trees with multiple fire sources. 14-19 - Gerold Jäger, Marcin Peczarski:
The worst case number of questions in Generalized AB game with and without white-peg answers. 20-31
- Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz
, Seongmin Ok
The minimum number of minimal codewords in an [n, k]-code and in graphic codes. 32-39 - N. R. Aravind, Subrahmanyam Kalyanasundaram
The chromatic discrepancy of graphs. 40-49 - Anne Berry, Andreas Brandstädt, Vassilis Giakoumakis, Frédéric Maffray:
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds. 50-61 - Monica Bianchi, Alessandra Cornaro
New bounds of degree-based topological indices for some classes of c-cyclic graphs. 62-75 - Monther Busbait
Diagnosis of constant faults in read-once contact networks over finite bases. 76-88 - Martin C. Cooper
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns. 89-113 - N. Safina Devi
Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs. 114-121 - Jean-Luc Fouquet, Frédéric Maffray:
Domination, coloring and stability in P5-reducible graphs. 122-129 - Tobias Friedrich
Parameterized clique on inhomogeneous random graphs. 130-138 - Shinya Fujita, Tomoki Nakamigawa, Tadashi Sakuma
Pebble exchange on graphs. 139-145 - Andrei V. Gagarin, Vadim E. Zverovich:
The probabilistic approach to limited packings in graphs. 146-153 - Laurent Gourvès, Jérôme Monnot, Lydia Tlilane:
Approximate tradeoffs on weighted labeled matroids. 154-166 - Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang:
Equitable total-coloring of subcubic graphs. 167-170 - Michael A. Henning
Domination versus disjunctive domination in trees. 171-177 - Benjamin Kraft:
Diameters of Cayley graphs generated by transposition trees. 178-188 - Atílio G. Luiz
AVD-total-colouring of complete equipartite graphs. 189-195 - José Luis Palacios:
On the Kirchhoff index of graphs with diameter 2. 196-201 - Jelena Sedlar
On the inverse sum indeg index. 202-212 - Baofeng Wu, Dongdai Lin:
On constructing complete permutation polynomials over finite fields of even characteristic. 213-222
- Peter Dankelmann
Proximity, remoteness and minimum degree. 223-228 - Michitaka Furuya:
A note on total domination and 2-rainbow domination in graphs. 229-230 - Modjtaba Ghorbani
Characterization of split graphs with at most four distinct eigenvalues. 231-236 - Robert Janczewski, Krzysztof Turowski
The computational complexity of the backbone coloring problem for planar graphs with connected backbones. 237-242 - Yubo Jing, Yingqian Wang
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles. 243-247 - Manami Shigeta, Kazuyuki Amano:
Ordered biclique partitions and communication complexity problems. 248-252 - Michel Surmacs
Quasi-Hamiltonian cycles in k-strong multipartite tournaments. 253-257 - Shiying Wang, Nana Zhao:
Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected. 258-263
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-11-19 20:35 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: