2349 | -- | 2360 | Bernardetta Addis, Marco Di Summa, Andrea Grosso. Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth |
2361 | -- | 2366 | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono. Optimal approximability of bookmark assignments |
2367 | -- | 2379 | Teodor Banica, Ion Nechita. Almost Hadamard matrices: The case of arbitrary exponents |
2380 | -- | 2388 | Flavia Bonomo, Mitre Costa Dourado, Guillermo Durán, Luerbio Faria, Luciano N. Grippo, Martín Darío Safe. Forbidden subgraphs and the König-Egerváry property |
2389 | -- | 2395 | Michael Brand. Friedman numbers have density 1 |
2396 | -- | 2404 | Kejun Chen, Guangzhou Chen, Wen Li, Ruizhong Wei. Super-simple balanced incomplete block designs with block size 5 and index 3 |
2405 | -- | 2409 | Gek L. Chia, Kai An Sim. On the skewness of the join of graphs |
2410 | -- | 2419 | Vitor Costa, Simone Dantas, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach. More fires and more fighters |
2420 | -- | 2426 | Michitaka Furuya. Upper bounds on the diameter of domination dot-critical graphs with given connectivity |
2427 | -- | 2439 | Xianya Geng, Shuchao Li, Meng Zhang. Extremal values on the eccentric distance sum of trees |
2440 | -- | 2459 | Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas. Patience of matrix games |
2460 | -- | 2466 | Michael A. Henning, Nader Jafari Rad. Bounds on neighborhood total domination in graphs |
2467 | -- | 2479 | Hervé Hocquard, Mickaël Montassier, André Raspaud, Petru Valicov. On strong edge-colouring of subcubic graphs |
2480 | -- | 2491 | Hongbo Hua, Kinkar Ch. Das. The relationship between the eccentric connectivity index and Zagreb indices |
2492 | -- | 2498 | W. Sean Kennedy, Andrew D. King. Finding a smallest odd hole in a claw-free graph using global structure |
2499 | -- | 2513 | George Kettleborough, Victor J. Rayward-Smith. Optimising sum-of-squares measures for clustering multisets defined over a metric space |
2514 | -- | 2526 | Sergey Kitaev, Pavel Salimov, Christopher Severs, Henning Úlfarsson. Restricted non-separable planar maps and some pattern avoiding permutations |
2527 | -- | 2531 | Xueliang Li, Mengmeng Liu. Bicyclic graphs with maximal revised Szeged index |
2532 | -- | 2536 | Wu-Hsiung Lin, Gerard J. Chang. bb-chromatic numbers of powers of paths and cycles |
2537 | -- | 2543 | Huiqiu Lin, Jinlong Shu. The distance spectral radius of digraphs |
2544 | -- | 2548 | Jianxi Liu. On a conjecture of the Randić index and the minimum degree of graphs |
2549 | -- | 2555 | Henry Liu, Angela Mestre, Teresa Sousa. k-connection in graphs |
2556 | -- | 2562 | Jens Maßberg. Online binary minimax trees |
2563 | -- | 2586 | Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta. How many attackers can selfish defenders catch? |
2587 | -- | 2596 | David Peleg, Ignasi Sau, Mordechai Shalom. d-girth of a graph |
2597 | -- | 2603 | Mikko Pelto. Optimal (r, ≤3)-locating-dominating codes in the infinite king grid |
2604 | -- | 2623 | Frank Plastria, José Gordillo, Emilio Carrizosa. Locating a semi-obnoxious covering facility with repelling polygonal regions |
2624 | -- | 2646 | Justo Puerto, A. B. Ramos, Antonio M. Rodríguez-Chía. A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems |
2647 | -- | 2652 | Oliver Schaudt. On dominating sets whose induced subgraphs have a bounded diameter |
2653 | -- | 2661 | Apurv Tiwari, Amitabha Tripathi. On the range of size of sum graphs & integral sum graphs of a given order |
2662 | -- | 2677 | Jean-Luc Toutant, Eric Andres, Tristan Roussillon. Digital circles, spheres and hyperspheres: From morphological models to analytical characterizations and topological properties |
2678 | -- | 2686 | Damir Vukicevic, Gilles Caporossi. Network descriptors based on betweenness centrality and transmission and their extremal values |
2687 | -- | 2694 | Yiqiao Wang 0002, Qiaojun Shu, Weifan Wang. The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle |
2695 | -- | 2701 | Iwona Wloch, Urszula Bednarz, Dorota Bród, Andrzej Wloch, Malgorzata Wolowiec-Musial. On a new type of distance Fibonacci numbers |
2702 | -- | 2715 | Yujun Yang, Douglas J. Klein. A recursion formula for resistance distances and its applications |
2716 | -- | 2723 | Manouchehr Zaker. Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs |
2724 | -- | 2730 | Jørgen Bang-Jensen, Sven Simonsen. Arc-disjoint paths and trees in 2-regular digraphs |
2731 | -- | 2739 | Monica Bianchi, Alessandra Cornaro, Anna Torriero. A majorization method for localizing graph topological indices |
2740 | -- | 2744 | Hanyuan Deng, S. Balachandran, S. K. Ayyaswamy, Y. B. Venkatakrishnan. On the harmonic index and the chromatic number of a graph |
2745 | -- | 2748 | Jong Yoon Hyun, Heisook Lee, Yoonjin Lee. Nonexistence of certain types of plateaued functions |
2749 | -- | 2752 | Hongwei Li, Shengjia Li, Yubao Guo, Michel Surmacs. On the vertex-pancyclicity of hypertournaments |
2753 | -- | 2757 | Hao Li, Weihua Yang. mm vertices and extra edge-connectivity of hypercubes |
2758 | -- | 2763 | Jakub Przybylo. On upper bounds for multiple domination numbers of graphs |
2764 | -- | 2771 | Julien Roland, Yves De Smet, José Rui Figueira. Inverse multi-objective combinatorial optimization |
2772 | -- | 2777 | Ian M. Wanless, Xiande Zhang. On the existence of retransmission permutation arrays |
2778 | -- | 2793 | Pietro Belotti, Julio C. Góez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky. On families of quadratic surfaces having fixed intersections with two hyperplanes |