default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 259
Volume 259, April 2019
- Julián Aráoz, Elena Fernández
, Salvador Rueda:
Location routing problems on trees. 1-18 - Beth Bjorkman, Garner Cochran, Wei Gao, Lauren Keough, Rachel Kirsch, Mitch Phillipson, Danny Rorabaugh, Heather C. Smith, Jennifer Wise:
k-foldability of words. 19-30 - Antoon Hendrik Boode, Hajo Broersma:
Decompositions of graphs based on a new graph product. 31-40 - Kuan-Ting Chu, Wu-Hsiung Lin, Chiuyuan Chen:
Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs. 41-52 - Matthew Fitch:
Implicit representation conjecture for semi-algebraic graphs. 53-62 - Nicolas Gastineau, Olivier Togni:
On S-packing edge-colorings of cubic graphs. 63-75 - Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On directed covering and domination problems. 76-99 - Michael A. Henning, Nader Jafari Rad:
A characterization of double Roman trees. 100-111 - Jing Jin, Baogang Xu:
Bisections of graphs without K2, l. 112-118 - Nathan Kahl:
Graph vulnerability parameters, compression, and quasi-threshold graphs. 119-126 - Adam Kozak, Tomasz Glowacki, Piotr Formanowicz:
A method for constructing artificial DNA libraries based on generalized de Bruijn sequences. 127-144 - Pingshan Li, Min Xu:
Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks. 145-152 - Huiqiu Lin:
On the sum of k largest distance eigenvalues of graphs. 153-159 - Lele Liu, Liying Kang, Shuliang Bai:
Bounds on the spectral radius of uniform hypergraphs. 160-169 - Xiaogang Liu:
Energies of unitary one-matching bi-Cayley graphs over finite commutative rings. 170-179 - Mengjie Lv, Shuming Zhou, Jiafei Liu, Xueli Sun, Guanqin Lian:
Fault diagnosability of DQcube under the PMC model. 180-192 - Elisa Tonello:
On the conversion of multivalued to Boolean dynamics. 193-204 - Haiyan Xu, Jinshuai Zhao, Ginger Y. Ke, Sharafat Ali:
Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution. 205-217
- Daniela Aguirre-Guerrero, Guillaume Ducoffe, Lluís Fàbrega, Pere Vilà, David Coudert:
Low time complexity algorithms for path computation in Cayley Graphs. 218-225 - Radoslav Fulek, János Pach:
Thrackles: An improved upper bound. 226-231 - Bart Litjens, Sven C. Polak, Vaidy Sivaraman:
Sum-perfect graphs. 232-239
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-09-14 23:43 CEST 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:
