Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 357
Volume 357, 2024
- Elmer Bergman, Lasse Leskelä
:
Connectivity of random hypergraphs with a given hyperedge size distribution. 1-13 - Ran Chen, Di Wu, Baogang Xu:
Structure of some ( P7, C4)-free graphs with application to colorings. 14-23 - Oscar Defrain, Antonio E. Porreca, Ekaterina Timofeeva:
Polynomial-delay generation of functional digraphs up to isomorphism. 24-33 - Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi:
Shortest odd paths in undirected graphs with conservative weight functions. 34-50 - Yu-Xia Hao, Xiaomeng Wang:
Regular sets in circulant graphs with degree 3. 51-55 - Ahmet Batal:
Effects of edge addition or removal on the nullity of a graph. 56-65 - Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers:
The weight balance function on trees. 66-73 - Ping Chen, Xin Zhang:
Improper odd coloring of IC-planar graphs. 74-80 - Toru Araki:
A lower bound for secure domination number of an outerplanar graph. 81-85 - Ivica Bosnjak, Rozália Madarász, Samir Zahirovic:
Some new results concerning power graphs and enhanced power graphs of groups. 86-93 - Daniel W. Cranston, Carl Feghali:
Kempe classes and almost bipartite graphs. 94-98 - Gang Zhang, Baoyindureng Wu:
k-isolation in graphs. 99-111 - Sheung Man Yuen, Warut Suksompong:
Approximate envy-freeness in graphical cake cutting. 112-131 - Eun-Kyung Cho, Minki Kim:
Independent domination versus packing in subcubic graphs. 132-134 - Fang Duan, Yuhong Yang:
Triangle-free signed graphs with small negative inertia index. 135-142 - François Lamothe, Claudio Contardo, Matthieu Gruson:
Tilted inequalities and facets of the set covering polytope: A theoretical analysis. 143-160 - Thomas Kalinowski, Uwe Leck:
Independent domination in the graph defined by two consecutive levels of the n-cube. 161-172 - Enrico Angelelli, Andrea Mor, Maria Grazia Speranza:
The one-station bike repositioning problem. 173-196 - Zeenath A. U., K. V. Lakshmy, Thomas W. Cusick, M. Sethumadhavan:
Construction and enumeration of balanced rotation symmetric Boolean functions. 197-208 - Chunmeng Liu, Jiang Zhou, Changjiang Bu:
The high order spectral extremal results for graphs and their applications. 209-214 - Lin Li, Rong-Xia Hao, Wen-Han Zhu:
The 3-path-connectivity of the star graphs. 215-235 - Shilong Yu, Yuefeng Yang, Yushuang Fan, Xuanlong Ma:
Perfect codes in 2-valent Cayley digraphs on abelian groups. 236-240 - Xiuwen Yang, Hajo Broersma, Ligong Wang:
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number. 241-257 - László F. Papp:
Restricted optimal pebbling is NP-hard. 258-263 - M. Rajesh Kannan, Pragada Shivaramakrishna, Hitesh Wankhede:
Constructing cospectral graphs by unfolding non-bipartite graphs. 264-273 - Hengzhe Li, Menghan Ma, Jianbing Liu, Xiao Zhao:
Addible edges in 2-matching-connected graphs and 3-matching-connected graphs. 274-281 - Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé:
A quasi-quadratic vertex-kernel for Cograph Edge Editing. 282-296 - Dazhi Lin, Tao Wang:
A note on Alon-Tarsi number of Halin graphs. 297-299 - Sinan Hu, Zhidan Luo, Yuejian Peng:
Saturation numbers of joins of graphs. 300-309 - Tithi Dwary, Kanduru V. Krishna:
Word-representability of graphs with respect to split recomposition. 310-321 - Mingzu Zhang, Zhaoxia Tian, Tengteng Liang, Hongxi Liu:
The edge fault-tolerance about the strong Menger edge-connectivity of order r among hamming graph. 322-330 - Junpeng Zhou, Xiying Yuan, Wen-Huan Wang:
A stability result for Berge-K3,t r-graphs and its applications. 331-342 - Ke Li, Zhao Zhang:
PTASs for secure dominating set in planar graphs and growth-bounded graphs. 343-351 - Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto:
On extremal factors of de Bruijn-like graphs. 352-364 - Manoj Changat, Ameera Vaheeda Shanavas, Peter F. Stadler:
Transit functions and pyramid-like binary clustering systems. 365-384 - Xin He, Heping Zhang:
Complete forcing numbers of (4,6)-fullerenes. 385-398
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-08-05 20:22 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:
