default search action
Discrete Applied Mathematics, Volume 181
Volume 181, January 2015
- David Amos, Yair Caro, Randy Davila, Ryan Pepper:
Upper bounds on the k-forcing number of a graph. 1-10 - Evripidis Bampis
, Alexander V. Kononov, Dimitrios Letsios
From preemptive to non-preemptive speed-scaling scheduling. 11-20 - Sergey Bereg
Balanced partitions of 3-colored geometric sets in the plane. 21-32 - Hongyan Cai, Huiqing Liu, Mei Lu:
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs. 33-40 - Santiago Canales, Gregorio Hernández-Peñalver
Distance domination, guarding and covering of maximal outerplanar graphs. 41-49 - Sheng-Hua Chen, Gerard Jennhwa Chang
The number of steps and the final configuration of relaxation procedures on graphs. 50-53 - Pelin Damci-Kurt, Santanu S. Dey
On the transportation problem with market choice. 54-77 - Zanoni Dias, Ulisses Dias
Sorting by Prefix Reversals and Prefix Transpositions. 78-89 - Rija Erves, Janez Zerovnik
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles. 90-97 - Guillaume Fertin
Path-driven orientation of mixed graphs. 98-108 - Ruo-Wei Hung
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks. 109-122 - Matt Hurshman, Jeannette C. M. Janssen
On the continuity of graph parameters. 123-129 - Pranava K. Jha, Jonathan D. H. Smith:
Cycle Kronecker products that are representable as optimal circulants. 130-138 - Nathaniel J. Karst
The minimum span of L(2, 1)-labelings of generalized flowers. 139-151 - Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano:
A generalization of Opsut's result on the competition numbers of line graphs. 152-159 - Martin Knor, Borut Luzar
Sandwiching the (generalized) Randić index. 160-166 - Xiao-Xin Li, Yi-Zheng Fan:
The connectivity and the Harary index of a graph. 167-173 - Min-Sheng Lin, Sheng-Huang Su:
Counting independent sets in a tolerance graph. 174-184 - Fuliang Lu, Lianzhu Zhang, Yan Wang:
The Pfaffian property of circulant graphs. 185-192 - Borut Luzar
l-facial edge colorings of graphs. 193-200 - Toufik Mansour
Some results on the avoidance of vincular patterns by multisets. 201-208 - Mauro Mezzini
On the geodeticity of the contour of a graph. 209-220 - Ragnar Nevries, Christian Rosenke:
Characterizing and computing the structure of clique intersections in strongly chordal graphs. 221-234 - Young Woong Park
Lot sizing with minimum order quantity. 235-254 - Shiying Wang, Lei Zhang, Shangwei Lin
k-restricted edge connectivity in (p+1)-clique-free graphs. 255-259 - Yujun Yang
Resistance distance-based graph invariants of subdivisions and triangulations of graphs. 260-274
- Therese Biedl:
On triangulating k-outerplanar graphs. 275-279 - Antonio Cossidente
Sets of even type on H(5, q2), q even. 280-282 - Éva Czabarka
On realizations of a joint degree matrix. 283-288 - Alexander V. Evako:
Classification of digital n-manifolds. 289-296 - Liqing Gao, Xirong Xu, Jian Wang, Dejun Zhu, Yuansheng Yang:
The decycling number of generalized Petersen graphs. 297-300 - Zhen Li, Yusheng Li:
Some star-critical Ramsey numbers. 301-305 - Ioan Tomescu
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices. 306-309 - Hung-Lung Wang:
Maintaining centdians in a fully dynamic forest with top trees. 310-315
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-01-18 00:52 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: