![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Discrete Applied Mathematics, Volume 320
Volume 320, October 2022
- Yipei Zhang, Xiumei Wang
, Jinjiang Yuan:
Bicritical graphs without removable edges. 1-10 - Jan Petr
, Julien Portier, Leo Versteegen
:
A faster algorithm for Cops and Robbers. 11-14 - Julien Bensmail, Hervé Hocquard, Pierre-Marie Marcille:
Going Wide with the 1-2-3 Conjecture. 15-32 - L. Bayón, Pedro Fortuny Ayuso
, J. M. Grau, Antonio M. Oller-Marcén
, M. M. Ruiz:
The multi-returning secretary problem. 33-46 - Leyou Xu
, Bo Zhou
:
On extremal spectral results of digraphs based on sum distance. 47-67 - Lan Lei
, Xiaoming Li, Yang Wu
, Taoye Zhang, Hong-Jian Lai:
Strengthened Ore conditions for (s, t)-supereulerian graphs. 68-80 - Helena Bergold
, Winfried Hochstättler
, Raphael Steiner
:
Colorings of oriented planar graphs avoiding a monochromatic subgraph. 81-94 - Theodore Molla, Michael Santana:
Disjoint cycles in graphs with restricted independence number. 95-105 - Dayong Wang, Jing Huang, Yejun Xu
:
Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences. 106-125 - Jelena Sedlar
, Riste Skrekovski
:
Vertex and edge metric dimensions of cacti. 126-139
- Michael Fuchs
, En-Yu Huang
, Guan-Ru Yu
:
Counting phylogenetic networks with few reticulation vertices: A second approach. 140-149
- Rafael M. Frongillo
, Jesse Geneson, Manuel E. Lladser
, Richard C. Tillquist
, Eunjeong Yi:
Truncated metric dimension for finite graphs. 150-169 - Florian Hörsch
, Zoltán Szigeti:
Reachability in arborescence packings. 170-183
- Lorenzo Traldi:
A note on geometric duality in matroid theory and knot theory. 184-190 - Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima:
Minimum degree conditions for the strength and bandwidth of graphs. 191-198
- Min Feng, Xuanlong Ma
, Lihua Feng:
Optimal identifying codes of two families of Cayley graphs. 199-210 - Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
:
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. 211-222 - Pierrick Méaux
:
On the algebraic immunity of direct sum constructions. 223-234 - Shao-Liang Chen
, Rong-Xia Hao
, Xiao-Wen Qin
:
Bounds for the connected domination number of maximal outerplanar graphs. 235-244 - Martín D. Safe
:
Essential obstacles to Helly circular-arc graphs. 245-258 - Sujing Cheng, Wuxian Chen
, Weigen Yan:
A type of generalized mesh-star transformation and applications in electrical networks. 259-269 - A. D. Tolmachev, D. S. Protasov, Vsevolod A. Voronov
:
Coverings of planar and three-dimensional sets with subsets of smaller diameter. 270-281 - Yoshimi Egawa, Michitaka Furuya
:
Forbidden triples generating a finite set of graphs with minimum degree three. 282-295 - Trung Duy Doan, Ingo Schiermeyer
:
The proper 2-connection number and size of graphs. 296-303
- Daniele Mundici
:
The read once formula of a series-parallel network. 304-310
- Mohammad Farrokhi Derakhshandeh Ghouchan
, Shekoofeh Gharakhloo, Ali Akbar Yazdan Pour
:
Positive matching decompositions of graphs. 311-323 - Ilan A. Goldfeder, Nahid Y. Javier-Nol
, Joaquín Tey:
A family of bipartite circulant tournaments with acyclic disconnection 3. 324-330 - Bojana Borovicanin
, Boris Furtula, Marija Jerotijevic:
On the minimum Harary index of graphs with a given diameter or independence number. 331-345 - Bin Fu, Yumei Huo, Hairong Zhao:
Streaming algorithms for multitasking scheduling with shared processing. 346-355 - Christian Go, Khwa Zhong Xuan, Xinyu Luo, Matthew T. Stamps
:
Spanning tree enumeration and nearly triangular graph Laplacians. 356-369 - Wayne Goddard, Kirsti Kuenzel
, Eileen Melville:
Well-hued graphs. 370-380 - Mostafa Einollahzadeh, Mohammad Ali Nematollahi
:
An improved lower bound for the Seidel energy of trees. 381-386
- Emily J. Evans
, Amanda E. Francis:
Algorithmic techniques for finding resistance distances on structured graphs. 387-407
- Shu-Guang Guo, Rong Zhang:
Sharp upper bounds on the Q-index of (minimally) 2-connected graphs with given size. 408-415 - András Frank
, Kazuo Murota
:
Fair integral submodular flows. 416-434 - Xiangqian Zhou, Heping Zhang
:
Some novel minimax results for perfect matchings of hexagonal systems. 435-445 - William B. Kinnersley
, Nikolas Townsend
:
Catching an infinitely fast robber on a grid. 446-461 - Jing Qu, Nanbin Cao
:
Edge metric dimension and mixed metric dimension of planar graph Qn. 462-475 - Haiyan Li
, Wen An Liu:
Adjoining to (K, s, t)-Wythoff's game its P-generators as moves. 476-487 - A. Karim Abu-Affash
, Paz Carmi, Adi Krasin:
A linear-time algorithm for minimum k-hop dominating set of a cactus graph. 488-499
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.