default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 247
Volume 247, October 2018
- Alexandre Prusch Züge, Renato Carmo:
On comparing algorithms for the maximum clique problem. 1-13 - Miaomiao Han
, Hong-Jian Lai, Jiaao Li:
Modulo orientations with bounded independence number. 14-22 - Anthony Bonato, Rita M. del Río-Chanona, Calum MacRury, Jake Nicolaidis, Xavier Pérez-Giménez, Pawel Pralat, Kirill Ternovsky:
The robot crawler graph process. 23-36 - Benjamin Momège:
Connected graph G with σ2(G)≥23n and K1, 4-free contains a Hamiltonian path. 37-42 - Luiz Emilio Allem, Fernando Tura:
Multiplicity of eigenvalues of cographs. 43-52 - Guillaume Fertin, Joseph G. Peters:
Optimal odd gossiping. 53-69 - Toru Araki, Hiroka Miyazaki:
Secure domination in proper interval graphs. 70-76 - Sandi Klavzar, Shuchao Li, Huihui Zhang:
On the difference between the (revised) Szeged index and the Wiener index of cacti. 77-89 - Mengmeng Liu, Shujing Wang:
Cactus graphs with minimum edge revised Szeged index. 90-96 - József Balogh, Hong Liu, Richard Montgomery:
Rainbow spanning trees in properly coloured complete graphs. 97-101 - Zhongyuan Che:
Structural properties of resonance graphs of plane elementary bipartite graphs. 102-110 - Suil O, Yongtang Shi:
Sharp bounds for the Randić index of graphs with given minimum and maximum degree. 111-115 - Simon Spacapan:
The diameter of strong orientations of Cartesian products of graphs. 116-121 - Terry A. McKee:
Strict chordal digraphs viewed as graphs with distinguished edges. 122-126 - Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Critical and maximum independent sets of a graph. 127-134 - Shuya Chen, Shuchao Li, Yueyu Wu, Lingli Sun:
Connectivity, diameter, minimal degree, independence number and the eccentric distance sum of graphs. 135-146 - Dinko Dimitrov, Laura Kasper, Yongjie Yang:
Gender consistent resolving rules in marriage problems. 147-151 - Irene Sciriha, Johann A. Briffa, Mark Debono:
Fast algorithms for indices of nested split graphs approximating real complex networks. 152-164 - Xiao-Wen Qin, Rong-Xia Hao:
Conditional edge-fault-tolerant Hamiltonicity of the data center network. 165-179 - Qiannan Zhou, Ligong Wang, Yong Lu:
Wiener index and Harary index on Hamilton-connected graphs with large minimum degree. 180-185 - Tao Xie:
A characterization of balanced Boolean functions with optimal algebraic immunity. 186-196 - Gerold Jäger, Marcel Turkensteen:
Extending single tolerances to set tolerances. 197-215 - Adi Jarden, Vadim E. Levit, Robert Shwartz:
Matchings in graphs and groups. 216-224 - Ville Junnila, Tero Laihonen, Tuomo Lehtila:
On regular and new types of codes for location-domination. 225-241 - Bojan Basic, Anna Slivková:
On optimal piercing of a square. 242-251 - Ademir Hujdurovic, Klavdija Kutnar, Dragan Marusic:
Enumerating graphs via even/odd dichotomy. 252-262 - Valentin E. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski, Matthew Szczepankiewicz, Joshua Terhaar:
Homothetic polygons and beyond: Maximal cliques in intersection graphs. 263-277 - Susumu Kubo, Katsuhiro Nishinari:
Applications of max-plus algebra to flow shop scheduling problems. 278-293 - Rafik Sahbi, Mustapha Chellali:
On some open problems concerning quorum colorings of graphs. 294-299 - Yujun Yang, Vladimir R. Rosenfeld:
Some spectral invariants of the neighborhood corona of graphs. 300-308 - Gang Ma, Qiuju Bian, Jianfeng Wang:
The weighted vertex PI index of bicyclic graphs. 309-321 - József Balogh, Tamás Mészáros, Zsolt Adam Wagner:
Two results about the hypercube. 322-326 - José Manuel Gómez Soto, Jesús Leaños, Luis Manuel Ríos-Castro, Luis Manuel Rivera:
The packing number of the double vertex graph of the path graph. 327-340 - Tomás Vetrík, Selvaraj Balachandran:
General multiplicative Zagreb indices of trees. 341-351 - Bostjan Bresar, Nazanin Movarraei:
On the number of maximal independent sets in minimum colorings of split graphs. 352-356 - Július Czap, Stanislav Jendrol', Juraj Valiska:
Facial L(2, 1)-edge-labelings of trees. 357-366 - Liqiong Xu, Shuming Zhou, Guanqin Lian:
Conditional diagnosability of multiprocessor systems based on complete-transposition graphs. 367-379 - Evangelos Bampas, Christina Karousatou, Aris Pagourtzis, Katerina Potika:
Minimum multiplicity edge coloring via orientation. 380-388 - Gerard Jennhwa Chang, Guan-Huei Duh:
On the precise value of the strong chromatic index of a planar graph with a large girth. 389-397 - Shinya Fujita, Michitaka Furuya:
Safe number and integrity of graphs. 398-406 - Zhao Lingqi, Xirong Xu, Bai Siqin, Huifeng Zhang, Yuansheng Yang:
The crossing number of locally twisted cubes LTQn. 407-418 - John Asplund, Thao Do, Arran Hamm, László A. Székely, Libby Taylor, Zhiyu Wang:
k-planar crossing number of random graphs and random regular graphs. 419-422 - Dmitriy S. Malyshev:
The weighted coloring problem for two graph classes characterized by small forbidden induced structures. 423-432 - Shanding Xu, Xiwang Cao, Guangkui Xu, Chunming Tang:
Optimal FHSs and DSSs via near zero-difference balanced functions. 433-447 - Hongying Lin, Bo Zhou:
On the von Neumann entropy of a graph. 448-455
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-15 00:52 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.
