default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 358
Volume 358, 2024
- Xiaodan Chen, Shuting Zhang:
On spectral radius of generalized arithmetic-geometric matrix of connected graphs and its applications. 1-12 - Shmuel T. Klein
, Elina Opalinsky, Dana Shapira:
Selective dynamic compression. 13-22 - Shmuel T. Klein, Elina Opalinsky, Dana Shapira:
Synchronizing dynamic Huffman codes. 23-32 - Tom Kelly, Luke Postle:
Improving the Caro-Wei bound and applications to Turán stability. 33-43 - Yingbin Ma, Mingli Wang, Wei Zhao, Kairui Nie:
Some results on (strong) total proper connection number of some digraphs. 44-56 - Subhabrata Paul, Kamal Santra:
Algorithmic study on 2-transitivity of graphs. 57-75 - Fangxu Xi, Ligong Wang:
Integral trees with diameter 6. 76-90 - Eshwar Srinivasan, Ramesh Hariharasubramanian:
Minimum length word-representants of graph products. 91-104 - Kantapong Wannatong, Yotsanan Meemark:
Perfect codes in m-Cayley hypergraphs. 105-111 - Alexander V. Karzanov:
On stable assignments generated by choice functions of mixed type. 112-135 - Serafino Cicerone, Gabriele Di Stefano, Sandi Klavzar, Ismael G. Yero:
Mutual-visibility in strong products of graphs via total mutual-visibility. 136-146 - Luyang Li, Xinchuan Huang, Qinglan Zhao, Dong Zheng:
Two classes of 1-resilient semi-bent functions based on disjoint linear codes. 147-157 - Zhengjiao Liu, Tao Wang, Xiaojing Yang:
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles. 158-166 - Shunhai He, Huiqing Liu:
On the rainbow planar Turán number of double stars. 167-175 - Wei Xiong, Xing Chen, Yang Wu, Zhifu You, Hong-Jian Lai:
Spanning connectivity of K1,r-free split graphs. 176-183 - Martin Kreh:
Pagoda functions for peg solitaire on graphs. 184-202 - Chuchu Wang, Yuefang Sun:
Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs. 203-213 - Zikai Tang, Hanyuan Deng:
Note on the eccentricity spectral radius of uniform hypertrees with given diameter. 214-216 - Endre Boros, Kazuhisa Makino:
Generating minimal redundant and maximal irredundant subhypergraphs. 217-229 - Mariia Anapolska, Tabea Brandt, Christina Büsing, Tobias Mömke:
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms. 230-253 - Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický:
Relaxation of Wegner's planar graph conjecture for maximum degree 4. 254-261 - Hongbo Hua, Hechao Liu:
Some results on vulnerability parameters and Wiener-type indices. 262-271 - Dorde Baralic, Jelena Ivanovic, Zoran Petric:
Chromatic numbers for facet colouring of some generalised associahedra. 272-284 - Asahi Takaoka:
Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words. 285-301 - Paolo Dulio, Andrea Frosini:
Integer orbits in rectangular lattice billiards. 302-319 - Danyi Li, Xing Feng, Weigen Yan:
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip. 320-325 - Xin Xu, Yue Hu, Xu Zhang:
An improved upper bound for planar Turán number of double star S2,5. 326-332 - M. Alfred Raju, P. Venkata Subba Reddy, Ismael G. Yero:
On the total version of the covering Italian domination problem. 333-343 - Ji-Hwan Jung, Suh-Ryung Kim, Hyesun Yoon:
A complete analysis of the convergence of Cm(D)m=1∞ for a multipartite tournament D. 344-357 - Sizhong Zhou, Yuli Zhang, Hongxia Liu:
Spanning k-trees and distance signless Laplacian spectral radius of graphs. 358-365 - Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen, D. K. Supraja:
On locating and neighbor-locating colorings of sparse graphs. 366-381 - Vladimir Gurvich, Mariya Naumova:
Screw discrete dynamical systems and their applications to exact slow NIM. 382-394 - Michael A. Henning, Shahin N. Jogan:
A characterization of graphs with given total coalition numbers. 395-403 - Wen-Han Zhu, Rong-Xia Hao, Kung-Jui Pai, Eddie Cheng:
Reliability analysis of exchanged hypercubes based on the path connectivity. 404-416 - Sandip Das, Abhiruk Lahiri, Soumen Nandi, Sagnik Sen, S. Taruni:
On (n,m)-chromatic numbers of graphs with bounded sparsity parameters. 417-428 - Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy:
On locally identifying coloring of Cartesian product and tensor product of graphs. 429-447 - Yanting Zhang, Ligong Wang:
Maxima of the Q-index for 3K3-free graphs. 448-456 - Teresa W. Haynes, Michael A. Henning:
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set. 457-467 - Fei-Huang Chang, Wei-Tian Li, Daphne Der-Fen Liu, Zhishi Pan:
On k-shifted antimagic spider forests. 468-476 - Boris Brimkov, Valentin E. Brimkov:
Graphs with degree sequence {(m-1)m,(n-1)n} and {mn,nm}. 477-486
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 2025-01-16 22:12 CET 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:
