default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 360
Volume 360, 2025
- Geir Agnarsson
, Elie Alhajjar, Aleyah Dawkins:
On locally finite ordered rooted trees and their rooted subtrees. 1-21 - Robert Scheffler:
Semi-proper interval graphs. 22-41 - Kazuo Murota, Akihisa Tamura:
Shapley-Folkman-type theorem for integrally convex sets. 42-50 - Xiaodong Chen, Jiayuan Zhang, Liming Xiong, Guifu Su:
Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs. 51-64 - Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Rita Zuazua:
On interval colouring reorientation number of oriented graphs. 65-80 - Xiaoyun Lv, Jianxi Li, Shou-Jun Xu:
Some results on {K2,C2i+1:i≥1}-factor in a graph. 81-92 - Jing Wang, Jiang Wu, Zhangdong Ouyang, Yuanqiu Huang:
The generalized 4-connectivity of burnt pancake graphs. 93-114 - Alexandr Polujan, Luca Mariot, Stjepan Picek:
On two open problems on the normality of bent functions. 115-118 - Jiacong Fu, Jian-Bo Lv:
On injective edge-coloring of graphs with maximum degree 4. 119-130 - Yuehan Wu, Chengxi Hong, Peifang Fu, Wenshui Lin:
Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3. 131-138 - Hyoungjun Kim, Thomas Mattman:
Dips at small sizes for topological graph obstruction sets. 139-166 - Zihan Zhou, Shuchao Li:
On the Aα-index of graphs with given order and dissociation number. 167-180 - Marco Dalai, Stefano Della Fiore, Adele A. Rescigno, Ugo Vaccaro:
An efficient algorithm for group testing with runlength constraints. 181-187 - Sizhong Zhou, Tao Zhang, Qiuxiang Bian:
A spectral condition for a graph to have strong parity factors. 188-195 - Shudan Xue, Zai Ping Lu, Hongwei Qiao:
Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs. 196-208 - Shufei Wu, Yuanyuan Zhong:
Maximum bisections of graphs without cycles of length four and five. 209-220 - Fábio Botler, Wanderson Lomenha, João Pedro de Souza:
On nonrepetitive colorings of paths and cycles. 221-228 - Kinkar Chandra Das, Da-yeon Huh, Jayanta Bera, Sourav Mondal:
Study on geometric-arithmetic, arithmetic-geometric and Randić indices of graphs. 229-245 - Mitre Costa Dourado, Marisa Gutierrez, Fábio Protti, Rudini Menezes Sampaio, Silvia B. Tondato:
Characterizations of graph classes via convex geometries: A survey. 246-257 - Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora, Stéphane Vialette:
Recognizing unit multiple interval graphs is hard. 258-274 - Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák:
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs. 275-281 - S. Shyama, Radha R. Iyer:
Unraveling the enigmatic irregular coloring of Honeycomb Networks. 282-296 - Fernanda Couto, Diego Amaro Ferraz, Sulamita Klein:
New results on edge-coloring and total-coloring of split graphs. 297-306
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-12-01 23: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:
