default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 285
Volume 285, October 2020
- Hengzhe Li, Yuanyuan Lu
, Baoyindureng Wu, Ankang Wei:
The κk-connectivity of line graphs. 1-8 - Gang Wang, Min-Yao Niu, Fang-Wei Fu:
Deterministic construction of compressed sensing matrices from constant dimension codes. 9-17 - Xihe Li, Ligong Wang:
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs. 18-29
- Khadijeh Fathalikhani, Azam Babai, Sara Sabrina Zemljic:
The Graovac-Pisanski index of Sierpiński graphs. 30-42
- Kosuke Nakamura, Toru Araki:
Partitioning vertices into in- and out-dominating sets in digraphs. 43-54
- Konstantin Amsharov, Andreas Knauf, Jörg Tomada:
Generating carbon nanotube caps of almost all chiralities, using six molecular segment types. 55-60
- Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Equations enforcing repetitions under permutations. 61-78 - Athanasios L. Konstantinidis, Charis Papadopoulos:
Maximizing the strong triadic closure in split graphs and proper interval graphs. 79-95 - Robert E. Kooij, Johan L. A. Dubbeldam:
Kemeny's constant for several families of graphs and real-world networks. 96-107
- Balázs Keszegh, Xuding Zhu:
A note about online nonrepetitive coloring k-trees. 108-112 - József Osztényi:
Proof of Stahl's conjecture in some new cases. 113-118
- Premysl Holub, Marko Jakovac, Sandi Klavzar:
S-packing chromatic vertex-critical graphs. 119-127 - Mariusz Grech, Andrzej Kisielewicz:
Synchronizing sequences for road colored digraphs. 128-140 - Jiangdong Ai, Hui Lei, Yongtang Shi, Shunyu Yao, Zan-Bo Zhang:
k-Ary spanning trees contained in tournaments. 141-146
- Qing Cui, Wenzhong Liu:
A note on 3-bisections in subcubic graphs. 147-152
- Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. 153-172 - Yuan-Hsun Lo, Hung-Lin Fu, Yijin Zhang, Wing Shing Wong:
The undirected optical indices of complete m-ary trees. 173-181
- Stephen Finbow, Rory MacIssac, Christopher M. van Bommel:
A short note on the existence of infinite sequences of γ-graphs of graphs. 182-187 - Hongbo Hua, Kinkar Chandra Das:
Comparative results and bounds for the eccentric-adjacency index. 188-196
- Zoran Stanic:
Net Laplacian controllability for joins of signed graphs. 197-203 - Shu-Li Zhao, Rong-Xia Hao:
The fault tolerance of (n, k)-bubble-sort networks. 204-211 - Yangjing Long, Peter F. Stadler:
Exact-2-relation graphs. 212-226 - Zeyu Liu, Xueping Li, Anahita Khojandi:
On the k-Strong Roman Domination Problem. 227-241 - Pawan K. Mishra, Sangram Kishor Jena, Gautam K. Das, S. V. Rao:
Capacitated discrete unit disk cover. 242-251 - Iswar Mahato, R. Gurusamy, M. Rajesh Kannan, S. Arockiaraj:
Spectra of eccentricity matrices of graphs. 252-260 - Chia-Wei Lee, Sun-Yuan Hsieh, Shuen-Shiang Yang:
R3-connectivity of folded hypercubes. 261-273
- Mika Shigemizu, Toshio Suzuki, Koki Usami:
Independent distributions on a multi-branching AND-OR tree of height 2. 274-282
- Susumu Kubo, Katsuhiro Nishinari:
An algebraic expression of the number partitioning problem. 283-296
- Hongbo Hua:
On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2. 297-300 - Kirill D. Kovalenko:
On the independence number and the chromatic number of generalized preferential attachment models. 301-306
- Fazal Hayat:
The minimum second Zagreb eccentricity index of graphs with parameters. 307-316 - Oguzhan Ersoy, Thomas Brochmann Pedersen, Emin Anarim:
Homomorphic extensions of CRT-based secret sharing. 317-329 - Kahina Meslem, Éric Sopena:
Distinguishing numbers and distinguishing indices of oriented graphs. 330-342
- Julien Baste, Maximilian Fürst, Michael A. Henning, Elena Mohr, Dieter Rautenbach:
Domination versus edge domination. 343-349
- Jianming Zhu:
Unicyclic signed graphs with the first ⌊n+12⌋ largest energies. 350-363 - Luis Gouveia, Markus Leitner, Ivana Ljubic:
A polyhedral study of the diameter constrained minimum spanning tree problem. 364-379 - Nathaniel J. Karst, Xierui Shen, Denise Sakai Troxell, MinhKhang Vu:
Blocking zero forcing processes in Cartesian products of graphs. 380-396 - Liqiong Xu, Hong-Jian Lai, Yingzhi Tian:
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. 397-406
- Xuewei Hu, Bo Yang, Meijuan Huang:
A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost. 407-422
- Katerina Medková, Edita Pelantová, Élise Vandomme:
On non-repetitive complexity of Arnoux-Rauzy words. 423-433 - Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Note on the bisection width of cubic graphs. 434-442 - Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu:
On-line DP-coloring of graphs. 443-453 - Moussa Daamouch:
Seymour's second neighborhood conjecture for 5-anti-transitive oriented graphs. 454-457 - Fengrong Zhang, Nastja Cepak, Enes Pasalic, Yongzhuang Wei:
Further analysis of bent functions from C and D which are provably outside or inside M#. 458-472 - Harish Vemuri:
Domination in direct products of complete graphs. 473-482 - Yu Yang, Xiao-Jun Sun, Jia-Yi Cao, Hua Wang, Xiao-Dong Zhang:
The expected subtree number index in random polyphenylene and spiro chains. 483-492 - Susil Kumar Bishoi, Kedarnath Senapati, B. R. Shankar:
Shrinking generators based on σ-LFSRs. 493-500 - Seyed Mahmoud Sheikholeslami, Mustapha Chellali, Marzieh Soroudi:
A characterization of perfect Roman trees. 501-508 - Antoine Dailly, Éric Duchêne, Urban Larsson, Gabrielle Paris:
Partition games. 509-525 - Omid Etesami, Willem H. Haemers:
On NP-hard graph properties characterized by the spectrum. 526-529 - Csilla Bujtás:
General upper bound on the game domination number. 530-538 - Abolfazl Poureidi, Nader Jafari Rad:
On algorithmic complexity of double Roman domination. 539-551 - Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. 552-566 - Guilherme de C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Intersection graph of maximal stars. 567-580 - Arpana Garg, Sucheta Dutt:
On rank and MDR cyclic and negacyclic codes of length pkover Zpm. 581-590
- Christoph Buchheim:
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization. 591-593
- Luiz Emilio Allem, Daniel A. Jaume, Gonzalo Molina, Maikon M. Toledo, Vilmar Trevisan:
Null decomposition of unicyclic graphs. 594-611 - Alexey Markin:
On the extremal maximum agreement subtree problem. 612-620 - David G. L. Wang, Monica M. Y. Wang:
A combinatorial formula for the Schur coefficients of chromatic symmetric functions. 621-630 - Isidoro Gitler, Gustavo Sandoval-Angeles:
An algorithm for delta-wye reduction of almost-planar graphs. 631-641 - Fuliang Lu, Xiaodan Chen:
The Pfaffian property of Cayley graphs on dihedral groups. 642-649 - Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage. 650-662 - Lihua You, Lihong Deng, Yufei Huang:
The maximum α-spectral radius and the majorization theorem of k-uniform supertrees. 663-675 - Juho Lauri, Christodoulos Mitillos:
Perfect Italian domination on planar and regular graphs. 676-687
- Irena Penev:
On the clique-width of (4K1, C4, C5, C7)-free graphs. 688-690
- Michael A. Henning, Gary MacGillivray, Frank Yang:
2-limited broadcast domination in subcubic graphs. 691-706 - Marc Goerigk, Jannis Kurtz, Michael Poss:
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty. 707-725
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-05-05 20:53 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:
