default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 279
Volume 279, May 2020
- Ivan Aidun
, Frances Dean, Ralph Morrison, Teresa Yu, Julie Yuan:
Treewidth and gonality of glued grid graphs. 1-11 - Miguel F. Anjos, José Neto:
A class of spectral bounds for Max k-Cut. 12-24 - Yousef Bagheri, Ali Reza Moghaddamfar, Farzaneh Ramezani:
The number of switching isomorphism classes of signed graphs associated with particular graphs. 25-33 - Giulio Cerbai, Luca S. Ferrari:
Permutation patterns in genome rearrangement problems: The reversal model. 34-48 - Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette:
Sorting with forbidden intermediates. 49-68 - Jovana Forcan, Mirjana Mikalacki:
On the WalkerMaker-WalkerBreaker games. 69-79 - Mei-Mei Gu, Rong-Xia Hao, Shyue-Ming Tang, Jou-Ming Chang:
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. 80-91 - Fengwei Li, Yansheng Wu, Qin Yue:
A class of functions with low-valued Walsh spectrum. 92-105 - Borut Luzar, Martina Mockovciaková, Pascal Ochem, Alexandre Pinlou, Roman Soták:
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}. 106-117 - Suil O:
The second largest eigenvalue and vertex-connectivity of regular multigraphs. 118-124 - Chin-Lin Shiue:
Distance restricted optimal pebbling in cycles. 125-133 - Jialei Song, Baogang Xu:
Partitions of graphs and multigraphs under degree constraints. 134-145 - Lin Sun:
Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles. 146-153 - Asahi Takaoka:
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover. 154-167 - Jianfeng Wang, Mei Lu, Lu Lu, Francesco Belardo:
Spectral properties of the eccentricity matrix of graphs. 168-177
- Ilkyoo Choi, Jinha Kim:
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path. 178-182 - Xia Hong, Huihui Zhang:
A Hamilton sufficient condition for completely independent spanning tree. 183-187 - Mohammad Reza Kazemi, Ali Mohades, Payam Khanteimouri:
On approximability of minimum color-spanning ball in high dimensions. 188-191 - Huazhong Lü, Tingzeng Wu:
On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes. 192-194 - Kenta Noguchi:
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3. 195-197 - Rainer Schrader, Lukas Stenmans:
A de Bruijn-Erdös Theorem for (q, q-4)-graphs. 198-201 - Chao Song, Xue Jin, Changqing Xu:
Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions. 202-209
- Zhixiong Chen, Andrew Klapper:
On q-nearly bent Boolean functions. 210-217 - Jingjing Li, Sihong Su:
Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity. 218-227
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 2026-09-02 00:59 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
