default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 322
Volume 322, December 2022
- Yibo Li, Huiqing Liu, Xiaolan Hu
:
Anti-Ramsey numbers for cycles in n-prisms. 1-8 - Lan Xiao, Yubao Guo:
Spanning acyclic subdigraphs and strong t-panconnectivity of tournaments. 9-19 - Jane Breen, Emanuele Crisostomi, Sooyeong Kim:
Kemeny's constant for a graph with bridges. 20-35 - Christina M. Mynhardt, Adriana Roux:
Irredundance graphs. 36-48 - Fan Yang, Jian-Liang Wu, Huimin Song:
The linear arboricity of K5-minor free graphs. 49-60 - Xiuwen Yang, Ligong Wang:
The eccentricity matrix of a digraph. 61-73 - Enqiang Zhu, Pu Wu, Zehui Shao:
Exact algorithms for counting 3-colorings of graphs. 74-93 - Cheng He, Hao Lin, Xinxin Han:
Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost. 94-101 - Modjtaba Ghorbani, Najaf Amraei:
A note on eigenvalue, spectral radius and energy of extended adjacency matrix. 102-116
- Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
A counter-example to the probabilistic universal graph conjecture via randomized communication complexity. 117-122
- Sinho Chewi, Patrik Gerber, Philippe Rigollet, Paxton Turner:
Gaussian discrepancy: A probabilistic relaxation of vector balancing. 123-141 - Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte, Alexandra Wesolek:
On asymptotic packing of geometric graphs. 142-152 - Lutz Volkmann:
Restrained Roman and restrained Italian domatic numbers of graphs. 153-159 - Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating dissociation, independence, and matchings. 160-165
- The Nguyen, Le Anh Vinh:
A point-plane incidence theorem in matrix rings. 166-170
- Xiaoqiang Wang, Dabin Zheng, Lei Hu:
Several classes of PcN power functions over finite fields. 171-182 - Chiara Cappello, Eckhard Steffen:
Frustration-critical signed graphs. 183-193
- Wei Gao, Weifan Wang, Yaojun Chen:
Tight isolated toughness bound for fractional (k, n)-critical graphs. 194-202
- Wen-Han Zhu, Rong-Xia Hao, Lin Li:
The 3-path-connectivity of the hypercubes. 203-209 - Martin Kochol:
Interpretations for the Tutte polynomials of morphisms of matroids. 210-216 - Amar Bapic, Enes Pasalic, Samir Hodzic:
Quadratic almost bent functions - Their partial characterization and design in the spectral domain. 217-236 - Mouhamad El Joubbeh:
On three blocks paths P(k, l, r). 237-239 - Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding kings in tournaments. 240-252 - Hong Zhang, Shuming Zhou, Eddie Cheng, Sun-Yuan Hsieh:
Characterization of component diagnosability of regular networks. 253-267
- Yoshimi Egawa, Michitaka Furuya, Mikio Kano:
Factors of bi-regular bipartite graphs. 268-272 - Qingjie Ye:
A note on the L(2, 1)-labelling problem of G(k, m). 273-275
- Sukanya Pandey, Vibha Sahlot:
Role coloring bipartite graphs. 276-285 - Yunxia Ren, Shiying Wang:
Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien's model. 286-294 - Éva Czabarka, Trevor Olsen, Stephen J. Smith, László A. Székely:
Minimum Wiener index of triangulations and quadrangulations. 295-310 - Wen-Huan Wang, Jin-Xiu Zhou, Rui Sun:
On the conjecture of the r-uniform supertrees with the eight largest α-spectral radii. 311-319 - Agnese Gini, Pierrick Méaux:
On the weightwise nonlinearity of weightwise perfectly balanced functions. 320-341 - Kinkar Chandra Das, Suresh Elumalai, Surojit Ghosh, Toufik Mansour:
On the Merrifield-Simmons index of tricyclic graphs. 342-354 - Nanao Kita:
Graft Analogue of general Kotzig-Lovász decomposition. 355-364 - Jianxin Wei, Yujun Yang:
Fibonacci and Lucas p-cubes. 365-383 - Naoki Matsumoto, Ryusei Moriyama, Katsuhiro Ota:
Graph grabbing game on totally-weighted graphs. 384-390
- Paul Ellis, Thotsaporn Thanatipanonda:
The arithmetic-periodicity of cut for C={1, 2c}. 391-403
- Péter G. N. Szabó:
Betweenness structures of small linear co-size. 404-424
- Sean Dewar:
Infinitesimal rigidity and prestress stability for frameworks in normed spaces. 425-438 - Steven J. Gortler, Miranda C. Holmes-Cerfon, Louis Theran:
Transverse rigidity is prestress stability. 439-441 - Daniel Irving Bernstein, Steven J. Gortler:
K5, 5 is fully reconstructible in ℂ3. 442-447 - Tibor Jordán, Christopher Poston, Ryan Roach:
Extremal families of redundantly rigid graphs in three dimensions. 448-464
- Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler:
Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. 465-480
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-08-05 23:13 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.
