Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 284
Volume 284, September 2020
- Jesse Geneson
:
Metric dimension and pattern avoidance in graphs. 1-7 - Helena Mysková, Ján Plávka:
Interval robustness of (interval) max-plus matrices. 8-19 - Aria L. Dougherty, Nicholas W. Mayers, Robert Short:
How to build a graph in n days: Some variations of graph assembly. 20-28 - Xia Li, Qin Yue:
The Hamming distances of repeated-root cyclic codes of length 5ps. 29-41 - Florent Foucaud, Shahrzad Heydarshahi, Aline Parreau:
Domination and location in twin-free digraphs. 42-52 - Michal Debski, Konstanty Junosza-Szaniawski, Malgorzata Sleszynska-Nowak:
Strong chromatic index of K1, t-free graphs. 53-60 - Nanao Kita:
Signed analogue of general Kotzig-Lovász decomposition. 61-70 - Ayotunde T. Egunjobi, Teresa W. Haynes:
Perfect double Roman domination of trees. 71-85 - Xuli Qi, Bo Zhou:
On the degree Kirchhoff index of unicyclic graphs. 86-98 - Mieczyslaw Borowiecki, Anna Fiedorowicz, Elzbieta Sidorowicz, Zsolt Tuza:
Independent (k+1)-domination in k-trees. 99-110 - Minjie Zhang, Chengyong Wang, Shuchao Li:
Extremal trees of given segment sequence with respect to some eccentricity-based invariants. 111-123 - Julien Bensmail, Kasper Szabo Lyngsie:
1-2-3 Conjecture in digraphs: More results and directions. 124-137 - Graciela L. Nasini, Pablo Daniel Torres:
Grundy dominating sequences on X-join product. 138-149 - Sadmir Kudin, Enes Pasalic:
Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization. 150-157 - Stefania Caputo, Gábor Korchmáros, Angelo Sonnino:
Multilevel secret sharing schemes arising from the normal rational curve. 158-165 - François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron:
Complexity of planar signed graph homomorphisms to cycles. 166-178 - Meysam Alishahi, Elahe Rezaei-Sani, Elahe Sharifi:
Maximum nullity and zero forcing number on graphs with maximum degree at most three. 179-194 - Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. 195-200 - Mark N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan:
Toughness and prism-hamiltonicity of P4-free graphs. 201-206 - Shengjie He, Rong-Xia Hao, Yan-Quan Feng:
On the edge-Szeged index of unicyclic graphs with perfect matchings. 207-223 - Mária Surimová, Borut Luzar, Tomás Madaras:
Adynamic coloring of graphs. 224-233 - Shaowei Sun, Kinkar Chandra Das:
Normalized Laplacian spectrum of complete multipartite graphs. 234-245 - Yanmei Hong, Qinghai Liu, Nannan Yu:
Edge decomposition of connected claw-free cubic graphs. 246-250 - Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai:
Restricted matching in plane triangulations and near triangulations. 251-261 - Zhongyuan Che:
Cube-free resonance graphs. 262-268 - Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time. 269-280 - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs. 281-289 - Abel Cabrera Martínez, Suitberto Cabrera García, Juan A. Rodríguez-Velázquez:
Double domination in lexicographic product graphs. 290-300 - Tomás Vetrík, Mesfin Masre:
General eccentric connectivity index of trees and unicyclic graphs. 301-315 - Trevor Leach, Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers:
The target location function on finite trees. 316-321 - Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
On matroid parity and matching polytopes. 322-331 - Huiqing Liu, Xuejiao Hu, Xiaolan Hu:
Burning number of caterpillars. 332-340 - Wayne Barrett, Emily J. Evans, Amanda E. Francis, Mark Kempton, John Sinkovic:
Spanning 2-forests and resistance distance in 2-connected graphs. 341-352 - Etienne Birmelé, Fabien de Montgolfier, Léo Planche, Laurent Viennot:
Decomposing a graph into shortest paths with bounded eccentricity. 353-374 - Lianying Miao, Jingru Pang, Shoujun Xu:
On the extremal values of the eccentric distance sum of trees with a given maximum degree. 375-383 - Abel Cabrera Martínez, Ismael G. Yero:
Constructive characterizations concerning weak Roman domination in trees. 384-390 - Kinkar Chandra Das, Abdullah Al-Azemi, Milica Andelic:
On energy and Laplacian energy of chain graphs. 391-400 - Changhong Lu, Rui Mao, Bing Wang:
Power domination in regular claw-free graphs. 401-415 - Bostjan Bresar, Michael A. Henning:
A 34-approximation of Vizing's conjecture for claw-free graphs. 416-422 - Marisa R. Gaetz, Caleb Ji:
Enumeration and extensions of word-representants. 423-433 - Kristina Ago, Bojan Basic:
On highly palindromic words: The ternary case. 434-443 - Anna Bachstein, Wayne Goddard, Connor Lehmacher:
The generalized matcher game. 444-453 - Bostjan Kuzman:
On k-rainbow domination in regular graphs. 454-464 - Guozhen Zhang:
The preclusion numbers and edge preclusion numbers in a class of Cayley graphs. 465-471 - Chunfang Li, Shangwei Lin, Shengjia Li:
Structure connectivity and substructure connectivity of star graphs. 472-480 - Xueliang Li, Yiyang Li, Jiarong Song:
The asymptotic value of graph energy for random graphs with degree-based weights. 481-488 - Italo J. Dejter:
On coloring the arcs of biregular graphs. 489-498 - Muhuo Liu, Haiying Shan, Xiaofeng Gu:
Spectral characterization of the complete graph removing a path. 499-512 - Michal Mankowski, Mikhail Moshkov:
Dynamic programming bi-criteria combinatorial optimization. 513-533 - Ivan Gutman:
Cycle energy and its size dependence. 534-537 - Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, Konstantinos Tsatsanis, Vasiliki Velona:
Minor-obstructions for apex sub-unicyclic graphs. 538-555 - Anthony Bonato, Huda Chuangpishit, Sean English, Bill Kay, Erin Meger:
The iterated local model for social networks. 556-571 - Esdras Mota, Leonardo S. Rocha, Ana Silva:
Connected greedy coloring of H-free graphs. 572-584 - Mitre Costa Dourado, Rodolfo Alves de Oliveira:
Complexity aspects of ℓ-chord convexities. 585-591 - Wei Dong:
L(p, q)-labeling of planar graphs with small girth. 592-601
- Miklós Bóna:
Stack words and a bound for 3-stack sortable permutations. 602-605 - Warut Suksompong:
On the number of almost envy-free allocations. 606-610 - Jian-Bo Lv, Jianxi Li:
The harmonic index of a graph and its DP-chromatic number. 611-615 - Muhuo Liu, Kun Cheng, Ioan Tomescu:
Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices. 616-621 - Jun Fujisawa, Carol T. Zamfirescu:
Non-hamiltonian 1-tough triangulations with disjoint separating triangles. 622-625 - Runrun Liu, Gexin Yu:
Planar graphs without short even cycles are near-bipartite. 626-630 - Huilan Chang, Dániel Gerbner, Balázs Patkós:
Finding non-minority balls with majority and plurality queries. 631-639
- Zoran Stanic:
Corrigendum to "On strongly regular signed graphs" [Discrete Applied Mathematics 271 (2019) 184-190]. 640
a service of 
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-07 00:50 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:
