default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 373
Volume 373, 2025
- Kaiyang Hu, Mingfang Huang:
An (F3,F4)-partition of planar graphs without 4- and 6-cycles. 1-9 - Yaxian Zhang, Heping Zhang
:
Perfect matchings of (4,6)-fullerenes with largest forcing number. 10-25 - Bostjan Kuzman:
On cubic rainbow domination regular graphs. 26-38 - Yingying Zhang, Fanfan Wang, Chenxu Yang:
Nordhaus-Gaddum-type results for monitoring edge-geodetic number of graphs. 39-52 - Wengang Jin, Kangquan Li, Longjiang Qu:
Several classes of minimal linear codes from weakly regular and non-weakly regular bent functions. 53-76 - Stephen Kirkland, Yuqiao Li, John S. McAlister, Xiaohong Zhang:
Edge addition and the change in Kemeny's constant. 77-90 - Shu-Guang Guo, Rong Zhang:
An ordering theorem on the Q-spectral radius of graphs with given size and its applications. 91-98 - Ligang Jin, Eckhard Steffen:
Information dissemination and confusion in signed networks. 99-106 - Eddie Cheng, László Lipták, Lucian Mazza:
Higher order matching preclusion for regular interconnection networks. 107-124 - Haiying Shan, Xiaoqi Liu:
Exploring graphs with distinct M-eigenvalues: Product operation, Wronskian vertices, and controllability. 125-136 - Yuefang Sun:
Compositions of digraphs: a survey. 137-153 - Xin Geng, Yueyang Hao, Weihua Yang:
Queue layouts on folded hypercubes. 154-158 - Jesús A. De Loera, Denae Ventura, Liuyue Wang, William J. Wesley:
Optimization tools for computing colorings of [1,...,n] with few monochromatic solutions on 3-variable linear equations. 159-178 - Oleg Duginov, Dmitriy Malyshev, Dmitriy Mokeev:
Partitioning vertices of graphs into paths of the same length. 179-195 - Bo-Jun Yuan, Ni Yang, Hong-Yan Ge, Shi-Cai Gong:
The number of dissociation sets in connected graphs. 196-203 - Xueliang Li, Ruiling Zheng:
Extremal results on the spectral radius of function-weighted adjacency matrices. 204-216 - Yali Wu, Xin Zhang:
On proper conflict-free colorings of IC-planar graphs. 217-223 - Guanru Li, Yi Wang, Qiqi Xiao:
On the unimodality of Zhang-Zhang polynomials of parallelogram chains. 224-230 - Yingbin Ma, Yuyu Zhao:
Some results on (1,2)-rainbow connection number. 231-238 - Suliman Khan:
Relation between the H-rank of a mixed graph and the girth of its underlying graph. 239-248 - Jiangdong Ai, Suil O, Liwen Zhang:
r-dynamic colorings and the spectral radius in graphs. 249-255 - Claude Carlet, Palash Sarkar:
Use of simple arithmetic operations to construct efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks. 256-270 - Li Wang, Mingxi Su, Liqing Lin, Xiaohui Hua:
Conditional matroidal edge connectivity of Cayley graphs. 271-278 - Zhixiong Chen, Arne Winterhof:
On the Nth 2-adic complexity of binary sequences identified with algebraic 2-adic integers. 279-289 - Qiang Wang, Liming Xiong:
Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition. 290-300 - Mingchao Zhou, Zhao Zhang:
Approximation algorithm for prize-collecting weighted set cover with fairness constraints. 301-315 - Yair Caro, Randy Davila, Ryan Pepper:
Comparing the p-independence number of regular graphs to the q-independence number of their line graphs. 316-326 - Alexander Clow, Melissa A. Huggan, Margaret-Ellen Messinger:
Cops and attacking robbers with cycle constraints. 327-342 - Suguru Yamada, Tesshu Hanaka:
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs. 343-354
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-08-09 19:08 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:
