default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 389
Volume 389, 2026
- Longjian Liao, Hongzhang Chen, Jianxi Li:
Two kinds of polygonal chains with extremal Kemeny's constants. 1-12 - Jia Jie Liu
:
The orbits of Möbius cubes. 13-25 - Wensheng Sun, Yujun Yang, Shou-Jun Xu:
On the minimum constant resistance curvature conjecture of graphs. 26-33 - Fernanda Couto, Luís Cunha, Daniel Posner:
Tree t -spanners for edge adjacency distances. 34-45 - Fei Wen, Zhongzheng Yue, Zepeng Li, Hong-Jian Lai:
On the neighbor full sum distinguishing total coloring of graphs. 46-57 - Guifu Su, Kaidi Zhang, Weili Guo, Junfeng Du, Xiaowen Qin, Lifei Song, Zhenghang Zhang, Hailin Shan, Ying Han, Yangyang Zhao, Zhiyuan Liu, Jun Xiao, Yupeng Wang, Zishu Zhu:
Results on k -leaf-connected graphs and digraphs: A survey. 58-82 - Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon:
Note about the complexity of the acyclic orientation with parity constraint problem. 83-91 - Florent Foucaud, Arti Pandey, Kaustav Paul:
Characterizing optimal monitoring edge-geodetic sets for some structured graph classes. 92-105 - Moritz Wehrmann, Arie M. C. A. Koster:
Efficient total domination and related invariants in torus graphs. 106-118 - Ji Zeng:
On average hitting time and Kemeny's constant for weighted trees. 119-125 - Yan Tang, Fengming Dong, Tao Tian:
Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs. 126-134 - Andrea Jiménez, Jessica McDonald, Reza Naserasr, Kathryn Nurse, Daniel A. Quiroz:
Balanced chromatic number and Hadwiger-like conjectures. 135-143
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-07-14 00:34 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
