default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 257
Volume 257, March 2019
- Hossein Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmoud Sheikholeslami
:
Signed double Roman domination in graphs. 1-11 - Adel Alahmadi, Michel Deza, Mathieu Dutour Sikiric, Patrick Solé:
The joint weight enumerator of an LCD code and its dual. 12-18 - Akbar Ali, Darko Dimitrov, Zhibin Du, Faiza Ishfaq:
On the extremal graphs for general sum-connectivity index (χα) with given cyclomatic number when α>1. 19-30 - Julien Bensmail:
A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs. 31-39 - Jean-Claude Bermond, Fatima Zahra Moataz:
On spectrum assignment in elastic optical tree-networks. 40-52 - Monica Bianchi, Alessandra Cornaro, José Luis Palacios, Anna Torriero:
Lower bounds for the geometric-arithmetic index of graphs with pendant and fully connected vertices. 53-59 - Robert Brignall, Ho-Jin Choi, Jisu Jeong, Sang-il Oum:
Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs. 60-66 - Qingqiong Cai, Tao Li, Yongtang Shi, Hua Wang:
Sum of weighted distances in trees. 67-84 - Vincent E. Coll, Colton Magnant, Pouria Salehi Nowbandegani:
Degree sum and graph linkage with prescribed path lengths. 85-94 - Július Czap, Stanislav Jendrol', Peter Sugerek, Juraj Valiska:
Facial packing vertex-coloring of subdivided plane graphs. 95-100 - Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. 101-114 - Randy Davila, Michael A. Henning:
On the total forcing number of a graph. 115-127 - Daniel Delbourgo, Kerri Morgan:
An algorithm which outputs a graph with a specified chromatic factor. 128-150 - Andrey A. Dobrynin:
Infinite family of 3-connected cubic transmission irregular graphs. 151-157 - Guillaume Ducoffe:
Finding cut-vertices in the square roots of a graph. 158-174 - Matthias R. Engelhardt, Thomas B. Preußer:
An easy counting lemma. 175-185 - Qian-Ping Gu, Gengchun Xu:
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. 186-205 - Jie Hu, Qiancheng Ouyang, Guanghui Wang:
Local antimagic orientations of d-degenerate graphs. 206-215 - Vesna Irsic:
Effect of predomination and vertex removal on the game total domination number of a graph. 216-225 - Liana Karapetyan, Vahan Mkrtchyan:
On maximum k-edge-colorable subgraphs of bipartite graphs. 226-232 - Yangfan Li, Mengjiao Rao, Tao Wang:
Minor stars in plane graphs with minimum degree five. 233-242 - Huiqing Liu, Xiaolan Hu, Shan Gao:
Hamiltonian cycles and paths in faulty twisted hypercubes. 243-249 - Changhong Lu, Bing Wang, Kan Wang, Yana Wu:
Paired-domination in claw-free graphs with minimum degree at least three. 250-259 - Lihuan Mao, Sebastian M. Cioaba, Wei Wang:
Spectral characterization of the complete graph removing a path of small length. 260-268 - Thomas Schweser, Michael Stiebitz:
Partitions of multigraphs under minimum degree constraints. 269-275 - Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Carsten Thomassen, Johan P. de Wet:
Hamilton cycles in sparse locally connected graphs. 276-288 - Jiachang Ye, Muhuo Liu, Yuedan Yao, Kinkar Chandra Das:
Extremal polygonal cacti for bond incident degree indices. 289-298 - Luzhen Ye, Weigen Yan:
Resistance between two vertices of almost complete bipartite graphs. 299-305 - Shu-Li Zhao, Rong-Xia Hao, Eddie Cheng:
Two kinds of generalized connectivity of dual cubes. 306-316 - Enqiang Zhu, Andrej Taranenko, Zehui Shao, Jin Xu:
On graphs with the maximum edge metric dimension. 317-324
- Qing Cui, Qinghai Liu:
2-bisections in claw-free cubic multigraphs. 325-330 - Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Maximum external Wiener index of graphs. 331-337 - Michitaka Furuya, Naoki Matsumoto:
Upper bounds on the locating chromatic number of trees. 338-341 - Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids induced by matchings. 342-349 - Martin Kochol:
Equivalent versions of group-connectivity theorems and conjectures. 350-352 - Danilo Korze, Ziga Markus, Aleksander Vesel:
A heuristic approach for searching (d, n)-packing colorings of infinite lattices. 353-358 - Dirk Meierling, Dieter Rautenbach:
Forcing brushes. 359-360 - Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Critical vertices and edges in H-free graphs. 361-367 - Saeed Shaebani:
A note on b-coloring of Kneser graphs. 368-369 - Zehui Shao, Huiqin Jiang, Pu Wu, Shaohui Wang, Janez Zerovnik, Xiaosong Zhang, Jia-Bao Liu:
On 2-rainbow domination of generalized Petersen graphs. 370-384 - Mario Ullrich:
A note on the dispersion of admissible lattices. 385-387 - Shuli Zhao, Weihua Yang:
Conditional connectivity of folded hypercubes. 388-392
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-14 21:05 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:
