default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 391
Volume 391, 2026
- Bo Ning
, Ganchao Zhang:
Degeneracy of toroidal graphs without special cycles. 1-4 - Richard C. Brewster, Gary MacGillivray, Ethan Williams:
Maneuver number in eternal domination. 5-14 - Vadim E. Zverovich:
On Camby-Plein's characterization of domination perfect graphs. 15-23 - Maidoun Mortada, Ayman El Zein:
A short proof that every claw-free cubic graph is ( 1 , 1 , 2 , 2 ) -packing colorable. 24-27 - Stijn Cambie, Jionghua Chang:
Maximum ratio of (graph) irregularities. 28-31 - Xiaodan Chen, Junwei Zi:
On the full Brouwer's conjecture on Laplacian eigenvalues. 32-44 - Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti:
Directed hypergraph connectivity augmentation by hyperarc reorientations. 45-56 - Zhengyu Guo, Gengsheng Zhang:
On generalized combinatorial batch codes. 57-67 - Sijin Li, Yifan Li, Xujun Liu:
Packing edge-colorings of subcubic outerplanar graphs. 68-82 - Sultan Ahmad, Rashid Farooq, Kinkar Chandra Das:
Generalized Sombor index of graphs with given degree sequences: Extremal results and applications. 83-100 - Jun Yue, Tianzi Huang:
A note on the disjunctive domination numbers of grids. 101-107 - Tianjiao Guo, Wen Liu, Gengsheng Zhang, Bo Hou:
Approximation algorithm for the W-prize-collecting scheduling problem on a single machine with release dates and rejection. 122-126 - L. Sunil Chandran, Suraj Kumar Sahoo:
Boxicity of zero divisor graphs. 127-136 - Yalan Li, Yulin Han:
The non-inclusive component diagnosability of hypercubes. 146-151 - Leilei Zhang:
The maximum size of a nonhamiltonian-connected graph with given order and minimum degree. 108-113 - Yuxing Yang, Jing Li, Shu-Li Zhao:
Girth tenacity of some cube-like networks. 114-121 - Kexin Yang, Ligong Wang:
Tricyclic graphs with the second largest distance eigenvalue less than -12. 137-145 - Naonori Kakimura, Yuta Mishima:
Reconfiguration of labeled matchings in triangular grid graphs. 152-175 - Aida Abiad, Harper Reijnders:
Eigenvalue bounds for distance-edge colourings. 176-191 - Emily H. Dickey, Noah A. Rosenberg:
Labeled histories and maximally probable labeled topologies with multifurcation. 192-203 - Muhuo Liu, Pengli Wei, Kinkar Chandra Das:
Minimum general Atom-bond sum-connectivity of c-cyclic graphs. 204-217 - Nathan Kahl, Kristi Luttrell:
On topological indices, graph compression, and threshold graphs. 218-230 - Daniel Berend, Shaked Mamana:
A probabilistic algorithm for Optimal Linear Arrangements. 231-248 - Yang Hu, Yuting Tian:
Completely independent spanning trees in split graphs. 249-257 - Eugen Füchsle, Hendrik Molter, Rolf Niedermeier, Malte Renken:
Temporal connectivity: Coping with foreseen and unforeseen delays. 258-276 - Johnson Phosavanh, Daniel Oron:
Minimizing total weighted late work with step-learning on a single machine. 277-293 - Lifeng Guo, Hang Yuan, Changhong Lu:
Hostile, Compatible, or Free: A constant time classification of pairwise shortest path conflicts in obstacle-free MAPF. 294-316 - Michael A. Henning, Pawan K. Mishra, Kartik Sehgal, Shaurya M. Tripathi, Sridhar Tuli:
Approximation algorithm for the semitotal domination problem in unit disk graphs. 317-327 - Frédéric Giroire, Frédéric Havet, Joanna Moulierac:
Kernelization of compressing two-dimensional routing tables with order. 328-340 - Jueru Liu, Lizhu Sun, Changjiang Bu:
The ordering of hypertrees and unicyclic hypergraphs by the traces of Aα-tensor. 341-353 - Stuti Mohanty, Bikramaditya Sahu:
Characterization of non-singular hyperplanes of Hs,q2 in PGs,q2. 354-363 - Zaphenath Joseph:
An EKR theorem for a class of generalized Hamming graphs. 364-366 - Briana Foster-Greenwood, Christine Uhl:
Metric dimension of a direct product of three complete graphs: The middle cone family. 367-381 - Manuel E. Lladser, Alexander J. Paradise:
Metric dimension and resolvability of Jaccard spaces. 382-391 - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
Restricted reachability in infinite digraphs. 392-398 - Yuquan Lin, Wensong Lin:
Computational results on semistrong edge coloring of graphs. 399-412 - Jifu Lin, Lihua You:
Oriented diameter of graphs with diameter 4 and given edge girth. 413-431 - Wenfei Liu, Jiafei Liu, Chia-Wei Lee, Sun-Yuan Hsieh, Jingli Wu, Gaoshi Li:
Two-Round Probabilistic Diagnosis Algorithm for fault identification. 432-448 - Yue Wang, Jian-liang Wu, Lin Sun:
On choosability with separation of K5-minor-free graphs. 449-455 - Naoki Matsumoto, Yumiko Ohno:
The achromatic number and the pseudoachromatic number of caterpillars. 456-463 - Anatoliy Kuznetsov, Nikolaos V. Sahinidis:
A deterministic global optimization algorithm for the Thomson and Tammes problems. 464-478 - Marién Abreu, Jan Goedgebeur, Jorik Jooken, Federico Romaniello, Tibo Van den Eede:
The Gray graph is pseudo 2-factor isomorphic. 479-487 - Zhengjiao Liu, Tao Wang, Xiaojing Yang:
Weak-strict degeneracy on line graphs of planar graphs. 488-495 - Ji Li, Yuefang Sun, Junran Yu, Xuemei You, Xiaoyan Zhang:
Sharp bounds and characterizations for cut-component numbers of graphs. 496-510 - Mohammed Lalou, Nader Mbarek, Abdallah Skender, Olivier Togni:
Completely independent spanning trees in split graphs: Structural properties and complexity. 511-522 - Liqing Lin, Li Wang:
Generalized fault-tolerance measures in pancake networks and their variants. 523-537
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-06-20 00:11 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:
