default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 205
Volume 205, May 2016
- Maria Axenovich, Jochen Harant, Jakub Przybylo, Roman Soták
, Margit Voigt, Jenny Weidelich:
A note on adjacent vertex distinguishing colorings of graphs. 1-7 - Bahareh Bafandeh, Dara Moazzami, Amin Ghodousian:
On the first-order edge tenacity of a graph. 8-15 - Adam Borchert, Skylar Nicol, Ortrud R. Oellermann:
Global cycle properties of locally isometric graphs. 16-26 - Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings. 27-34 - Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
On the readability of overlap digraphs. 35-44 - Kinkar Chandra Das, Muhuo Liu:
Complete split graph determined by its (signless) Laplacian spectrum. 45-51 - Malte Fliedner, Dirk Briskorn, Nils Boysen:
Vehicle scheduling under the warehouse-on-wheels policy. 52-61 - Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
Clique-width of path powers. 62-72 - Michael A. Henning, Felix Joos, Christian Löwenstein, Dieter Rautenbach:
Induced 2-regular subgraphs in k-chordal cubic graphs. 73-79 - Che-Nan Kuo:
Vertex-fault-tolerant cycles embedding in 4-conditionally faulty folded hypercubes. 80-85 - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On self-clique shoal graphs. 86-100 - Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation algorithms for minimum (weight) connected k-path vertex cover. 101-108 - Daniel C. McDonald:
List rankings and on-line list rankings of graphs. 109-125 - Mohammad Reza Oboudi:
On the roots of domination polynomial of graphs. 126-131 - Jung-Heum Park, Joonsoo Choi, Hyeong-Seok Lim:
Algorithms for finding disjoint path covers in unit interval graphs. 132-149 - Alexander Reich:
Minimum strictly fundamental cycle bases of planar graphs are hard to find. 150-159 - Hiroki Sayama:
Estimation of Laplacian spectra of direct and strong product graphs. 160-170 - Susan A. van Aardt, Marietjie Frick, Ortrud R. Oellermann, Johan P. de Wet:
Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs. 171-179 - Xinhong Zhang, Ruijuan Li:
The (1, 2)-step competition graph of a pure local tournament that is not round decomposable. 180-190 - Zhongxun Zhu, Yunchao Hong:
Minimum degree distance among cacti with perfect matchings. 191-201
- José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Averaging 2-rainbow domination and Roman domination. 202-207 - Peter Damaschke:
Adaptive group testing with a constrained number of positive responses improved. 208-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 2024-12-30 19:29 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:
