default search action
Discrete Applied Mathematics, Volume 377
Volume 377, 2025
- Jie Zhang, Zhilan Wang, Jin Yan:
A generalization of the Hamiltonian cycle in dense digraphs. 1-9 - Jungho Ahn
, Seonghyuk Im, Sang-il Oum
The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs. 10-17 - Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno:
Listing maximal H-free subgraphs. 18-31 - Shudan Lu, Fengxia Liu
The list r-hued coloring of Halin graph. 32-42 - Hui Ma, Xiaomin Hu, Weihua Yang:
Characterization of minimally t-tough, 2K2-free graphs for 1t≤2. 43-50 - Hao Li, Hongwei Qiao, Eminjan Sabir
Robustness of reliability bounds for (n,k)-star networks. 51-65 - Ishay Haviv
A near-optimal kernel for a coloring problem. 66-73 - Masahiro Hachimori
The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game. 74-86 - Carol T. Zamfirescu
On platypus graphs and the Steiner-Deogun property. 87-94 - Junying Lu
Oriented Ramsey numbers of some sparse graphs. 95-101 - Guangfeng Li, Jian Sun, Jiaquan Gao, Zhiren Sun, Xiaoyan Zhang:
An improved approximation algorithm for Hypergraph Max p-Section. 102-112 - Majun Shi
Submodular + Supermodular function maximization with knapsack constraint. 113-133 - Xiaodi Song, Cristina Dalfó
On the algebraic connectivity of token graphs and graphs under perturbations. 134-146 - Lan Lin
The spanning tree congestion problem on interval graphs. 147-153 - Alireza Shavali, Hamid Zarrabi-Zadeh
On the biplanar and k-planar crossing numbers. 154-161 - Michael Yatauro
2-factors in 1-tough k-connected graphs with prescribed independence number. 162-169 - Bhawani Sankar Panda
Hardness and approximation results for some variants of Stable Marriage problem. 170-182 - Zhenghang Zhang, Guifu Su, Xiaowen Qin, Junfeng Du, Weili Guo, Yue Wu:
Several graph properties in terms of the multiplicative version of the first Zagreb index. 183-194 - Yifan Yao, Zhong Huang, Yaping Mao
Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities. 195-203 - Maximilian Gorsky
Computing the forcing spectrum of outerplanar graphs in polynomial time. 204-217 - Ruyu Song, Sha Wang, Yanbo Zhang
Online Ramsey numbers of K1,3 versus paths. 218-224 - Luis Chahua
On Tuza's conjecture in dense graphs. 225-233 - Tianyi Bu, Shaobin Huang, Jiang Zhou:
Bounds on the resistance distance and Kirchhoff index of graphs. 234-241 - Chris J. Mitchell
Orientable and negative orientable sequences. 242-259 - Chen Guo, Qiuli Mo, Shuo Peng, Zhifang Xiao
A local edge diagnosability measure for multiprocessor systems. 260-268 - Jiaao Li
Modulo k-orientations of random regular graphs. 269-288 - Shu-Li Zhao, Bao-Cheng Zhang, Jou-Ming Chang
{1, 2}-good-neighbor conditional diagnosability of Cayley graphs generated by k-trees. 289-298 - Prabhat Kumar Chand
Fault-tolerant dispersion of mobile robots. 299-313 - François Rioult
Size-optimal Boolean matrix factorization. 314-326 - Xiaoxiao Qin, Fangyu Zhao, Hong-Jian Lai, Bofeng Huo:
Supereulerian of regular matroids with cogirth conditions. 327-334 - Li Zhang, Hajo Broersma
An adjacency lemma on signed edge colorings with an application to planar graphs. 335-342 - Zeyuan Wu, Hongzhang Chen
The size and the spectral radius of a saturated non-covered graph. 343-349 - Ushnish Sarkar
A note on obtaining bipartite radio graceful graphs of arbitrarily large radio numbers with radio graceful complements. 350-355 - Tonguç Ünlüyurt:
Sequential testing problem: A follow-up review. 356-369 - Manouchehr Zaker:
On z-coloring and b∗-coloring of graphs as improved variants of the b-coloring. 370-379 - Alexandre Dupont-Bouillard
Contractions in perfect graphs. 380-389 - Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. 390-401 - Hongxia Ma, Zhuo Li:
The average order of a connected vertex set in generalized ladder graphs. 402-413 - Lusheng Fang, An Chang, Weilun Xu, Guorong Gao, Yuan Hou:
The spectral radius of 3-graphs without Berge paths of given length. 414-428 - Stanislaw Gawiejnowicz
Two new approximation schemes for maximizing the weighted number of just-in-time jobs in a multi-machine proportionate flow shop. 429-435 - Amina Riaz, Hafiz Muhammad Afzal Siddiqui, Nasir Ali
Graph-theoretic characterization of rings: Outer multiset dimension of zero-divisor graphs. 436-444 - Aseem Dalal, B. S. Panda:
On total chromatic number of complete multipartite graphs. 445-458 - Jørgen Bang-Jensen
Generalized paths and cycles in semicomplete multipartite digraphs. 459-479 - Ishan Bansal, Oktay Günlük, Richard Shapley:
Parallel token swapping for qubit routing. 480-497 - Eshwar Srinivasan, Ramesh Hariharasubramanian
On semi-transitive orientability of circulant graphs. 498-509 - Samvel Kh. Darbinyan:
On Hamiltonian bypasses in orgraphs with large semi-degrees. 510-517 - Lukai Sui, Qiuli Li:
Extremal trees with fixed order and diameter for average size of maximal matchings. 518-528 - Zhongyuan Che, Zhibo Chen:
A decomposition structure of resonance graphs that are daisy cubes. 529-540 - Danning Wang, Jun Yue:
Chords of longest cycles in 3-connected graphs with some special circumferences. 541-551 - Bijo S. Anand, S. V. Ullas Chandran
Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products. 552-561 - Sergei Drozdov:
Egan conjecture holds. 562-572 - Jun Yuan
The completely independent spanning trees in P4-free graphs. 573-585 - Yisai Xue, Liying Kang:
On generalized Turán number of graphs with bounded matching number. 586-597 - Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud, Krishna Narayanan
Monitoring edge-geodetic sets in graphs. 598-610
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 2026-05-08 00:55 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: