default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 361
Volume 361, 2025
- Jing Gao, Xueliang Li, Ning Yang, Ruiling Zheng:
Maximum energy bicyclic graphs containing two odd cycles with one common vertex. 1-21 - Kamal Dliou
:
Independence, matching and packing coloring of the iterated Mycielskian of graphs. 22-33 - Jing Lou, Ruifang Liu, Jinlong Shu:
Toughness and distance spectral radius in graphs involving minimum degree. 34-47 - Xiaoyan Lai, Yishuo Shi:
Approximation algorithm of maximizing non-submodular functions under non-submodular constraint. 48-68 - Weimin Qian, Feng Li:
Exact vertex forwarding index of the Strong product of complete graph and cycle. 69-84 - Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Well-indumatched Pseudoforests. 85-102 - Sean McGuinness:
Serial exchanges in random bases. 103-110 - Yasir Ahmad, Xiang-Feng Pan, Umar Ali, Zhuo Diao:
Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains. 111-120 - Zakir Deniz:
An improved bound for 2-distance coloring of planar graphs with girth six. 121-135 - Bilal Ahmad Rather, Mustapha Aouchiche:
Distance Laplacian spectra of graphs: A survey. 136-195 - Tobias Boege, Janneke H. Bolt, Milan Studený:
Self-adhesivity in lattices of abstract conditional independence models. 196-225 - Kenjiro Takazawa:
Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond. 226-235 - Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette, Yacong Zhou:
Quasi-kernels in split graphs. 236-243 - Atif A. Abueida, Arthur H. Busch, R. Sritharan:
Intersection of chordal graphs and some related partition problems. 244-257 - Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints. 258-275 - Koki Shinraku, Katsuhisa Yamanaka, Takashi Hirayama:
Efficient enumeration of transversal edge-partitions. 276-287 - Lu Qiao, Shenggui Zhang, Jing Li, Nan Gao:
Coulson-type integral formulas for the general (skew) Estrada index of a vertex. 288-303 - Soogang Eoh, Suh-Ryung Kim, Hojun Lee:
The phylogeny number of a graph in the aspect of its triangles and diamonds. 304-314 - Chenghao Shen, Haiying Shan:
Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size. 315-323 - Yanting Zhang, Ligong Wang:
The α-index of graphs without intersecting triangles/quadrangles as a minor. 324-335 - Matheus Adauto, Celina M. H. de Figueiredo, Glenn Hurlbert, Diana Sasaki:
On the pebbling numbers of Flower, Blanuša and Watkins snarks. 336-346 - Alice Raffaele, Romeo Rizzi:
New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems. 347-369 - Anthony Nixon, Bernd Schulze, Joseph Wall:
Rigidity of symmetric linearly constrained frameworks in the plane. 370-388 - Manoj M. Belavadi, Kathie Cameron:
Recoloring some hereditary graph classes. 389-401 - Sizhong Zhou, Hongxia Liu:
Star-factors with large components, fractional k-extendability and spectral radius in graphs. 402-411 - Sibylle Möhle, Roberto Sebastiani, Armin Biere:
On enumerating short projected models. 412-439 - Wenying Xi, Wensong Lin, Yuquan Lin:
Packing 2- and 3-stars into (2,3)-regular graphs. 440-452 - Ilan Doron-Arad, Hadas Shachnai:
Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs. 453-464 - Jun Fan, Xiaomin Hu, Weihua Yang, Shuang Zhao:
On vertices of outdegree k in minimally k-arc-connected digraphs. 465-472 - Yuanyuan Duan, Liang-ji Sun, Wenyao Song:
Neighbor sum distinguishing total choosability of planar graphs without intersecting 4-cycles. 473-479 - Jinxing Zhao, Xiaoxiang Yu:
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching. 480-486 - Jing Zhao, Huiqing Liu, Jin Xiong:
On the minimum spectral radius of graphs with given order and dissociation number. 487-501 - Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Complexity of Maker-Breaker games on edge sets of graphs. 502-522 - Menglu He, Zemin Jin:
Rainbow short linear forests in edge-colored complete graph. 523-536
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-11-26 07:59 CET 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:
