Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 282
Volume 282, August 2020
- Mikkel Abrahamsen
, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-optimal induced universal graphs for cycles and paths. 1-13 - Yandong Bai, Binlong Li, Shenggui Zhang:
Kernels by rainbow paths in arc-colored tournaments. 14-21 - Aritra Banik, Matthew J. Katz, Eli Packer, Marina Simakov:
Tracking Paths. 22-34 - Matthew Beaudouin-Lafon, Margaret Crawford, Serena Chen, Nathaniel J. Karst, Louise Nielsen, Denise Sakai Troxell:
On the zero blocking number of rectangular, cylindrical, and Möbius grids. 35-47 - Bostjan Bresar, Mario Valencia-Pabon:
On the P3-hull number of Hamming graphs. 48-52 - Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger:
Limited visibility Cops and Robber. 53-64 - Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for 2-factor extension. 65-79 - Július Czap, Stanislav Jendrol', Juraj Valiska:
Edge-coloring of plane multigraphs with many colors on facial cycles. 80-85 - Soogang Eoh, Jihoon Choi, Suh-Ryung Kim, Miok Oh:
The niche graphs of bipartite tournaments. 86-95 - Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar:
Maker-Breaker total domination game. 96-107 - Xiaxia Guan, Weihua Yang:
Embedding planar 5-graphs in three pages. 108-121 - Leslie Hogben:
Zero forcing and maximum nullity for hypergraphs. 122-135 - Gergely Kovács, Benedek Nagy, Béla Vizvári:
On disks of the triangular grid: An application of optimization theory in discrete geometry. 136-151 - Tianlong Ma, Jinling Wang, Mingzu Zhang, Xiaodong Liang:
Path 3-(edge-)connectivity of lexicographic product graphs. 152-161 - Michael D. Plummer, Dong Ye, Xiaoya Zha:
Dominating maximal outerplane graphs and Hamiltonian plane triangulations. 162-167 - Dmitry A. Shabanov:
Estimating the r-colorability threshold for a random hypergraph. 168-183 - Barak Shani:
The security of all private-key bits in isogeny-based schemes. 184-195 - Asahi Takaoka:
A recognition algorithm for simple-triangle graphs. 196-207 - Wen Chean Teh, Zhen Chuan Ng, Muhammad Javaid, Zi Jing Chern:
Parikh word representability of bipartite permutation graphs. 208-221 - Niko Tratnik:
Generalized cut method for computing the edge-Wiener index. 222-233 - Li Zhang, You Lu, Rong Luo, Dong Ye, Shenggui Zhang:
Edge coloring of signed graphs. 234-242 - Leilei Zhang, Qishun Li, Shuchao Li, Minjie Zhang:
The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain. 243-256 - Matthias Függer, Thomas Nowak, Kyrill Winkler:
On the radius of nonsplit graphs and information dissemination in dynamic networks. 257-264 - Janusz Dybizbanski, Tomasz Dzido, Renata Zakrzewska:
On-line Ramsey numbers for paths and short cycles. 265-270 - Pavol Hell, Hiroshi Nishiyama, Ladislav Stacho:
Hamiltonian cycles in covering graphs of trees. 271-281
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-06-10 21:29 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:
