Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 277
Volume 277, April 2020
- Simona Bonvicini, Margherita Maria Ferrari
:
On the minimum number of bond-edge types and tile types: An approach by edge-colorings of graphs. 1-13 - Axel Brandt, Nathan Tenpas, Carl R. Yerger:
Planar graphs with girth 20 are additively 3-choosable. 14-21 - Matteo Cavaleri, Alfredo Donno:
Some degree and distance-based invariants of wreath products of graphs. 22-43 - Sarula Chang, An Chang, Yirong Zheng:
The leaf-free graphs with nullity 2c(G)-1. 44-54 - Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Yan Wang, Guijuan Wang:
An improved algorithm to construct edge-independent spanning trees in augmented cubes. 55-70 - Joanna Sokól, Konstanty Junosza-Szaniawski, Pawel Rzazewski:
L(2, 1)-labeling of disk intersection graphs. 71-81 - Michal Debski, Konstanty Junosza-Szaniawski, Zbigniew Lonc:
Bundling all shortest paths. 82-91 - Sergi Elizalde, Katherine Moore:
Characterizations and enumerations of patterns of signed shifts. 92-114 - Amine El Sahili, Maria Abi Aad:
About the number of directed paths in tournaments. 115-126 - Christian Engels, B. V. Raghavendra Rao:
On hard instances of non-commutative permanent. 127-138 - Jan Goedgebeur, Edita Mácajová, Martin Skoviera:
The smallest nontrivial snarks of oddness 4. 139-162 - Felix Goldberg, Steve Kirkland, Anu Varghese, Ambat Vijayakumar:
On split graphs with four distinct eigenvalues. 163-171 - Mariusz Grech, Andrzej Kisielewicz:
Graphical representations of cyclic permutation groups. 172-179 - Pamela E. Harris, Dalia K. Luque, Claudia Reyes Flores, Nohemi Sepulveda:
Efficient (t, r) broadcast dominating sets of the triangular lattice. 180-192 - Puning Jing, Zhengke Miao, Zi-Xia Song:
Some remarks on interval colorings of complete tripartite and biregular graphs. 193-197 - Noboru Kunihiro, Atsushi Takayasu:
Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes. 198-220 - Ruizhi Lin, Heping Zhang, Weisheng Zhao:
Matching preclusion for direct product of regular graphs. 221-230 - Wensong Lin:
Channel assignment problem and relaxed 2-distant coloring of graphs. 231-244 - Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu:
DP-4-colorability of planar graphs without adjacent cycles of given length. 245-251 - Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal 6-edge-colorings of some bridgeless cubic graphs. 252-262 - Xu Wang, Xuxu Zhao, Haiyuan Yao:
Structure and enumeration results of matchable Lucas cubes. 263-279 - Ahad N. Zehmakan:
Opinion forming in Erdős-Rényi random graph and expanders. 280-290
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-07-01 21:39 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:
