default search action
Discrete Applied Mathematics, Volume 298
Volume 298, July 2021
- Tomislav Doslic:
Restricted 2-extendability of (3, 6)-fullerenes. 1-6 - Matthew Ceko, Silvia M. C. Pagani, Rob Tijdeman:
Algorithms for linear time reconstruction by discrete tomography II. 7-20 - Carl Johan Casselgren, Jonas B. Granholm, André Raspaud:
On star edge colorings of bipartite and subcubic graphs. 21-33 - Klavdija Kutnar, Dragan Marusic, Stefko Miklavic, Primoz Sparl:
On extendability of co-edge-regular graphs. 34-49
- Emiliano J. J. Estrugo, Adrián Pastine:
On stars in caterpillars and lobsters. 50-55
- Yan Yuan, Bo Zhou, Zhibin Du:
On large ABC spectral radii of unicyclic graphs. 56-65 - Neranga Fernando, Sartaj Ul Hasan, Mohit Pal:
Dembowski-Ostrom polynomials and reversed Dickson polynomials. 66-79
- Nicholas Crawford, Sogol Jahanbekam, Katerina Potika:
Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7. 80-83
- Chandratop Chakraborty, Pranab Chakraborty, Subhamoy Maitra:
Glimpses are forever in RC4 amidst the spectre of biases. 84-102 - Fangfang Zhang, Xiutao Zhu, Yaojun Chen:
Gallai-Ramsey numbers for multiple triangles. 103-109 - René van Bevern, Oxana Yu. Tsidulko, Philipp Zschoche:
Representative families for matroid intersections, with applications to location, packing, and covering problems. 110-128 - Gennadiy Averkov, Giulia Codenotti, Antonio Macchia, Francisco Santos:
A local maximizer for lattice width of 3-dimensional hollow bodies. 129-142 - Bostjan Bresar, Jasmina Ferme, Karolína Kamenická:
S-packing colorings of distance graphs G(Z, {2, t}). 143-154 - Naoki Matsumoto, Tomoki Nakamigawa:
Game edge-connectivity of graphs. 155-164 - Martin Koutecký, Shmuel Onn:
Uniform and monotone line sum optimization. 165-170
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.