default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 333
Volume 333, July 2023
- Eduard Yu. Lerner
:
A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences. 1-12
- Peter Bradshaw:
A note on the connected game coloring number. 13-19
- Keith Gallegos, Jeremy Lyle:
Graphs with small Italian domatic number. 20-31 - Jai Moondra, Aditya Sahdev, Amitabha Tripathi:
Exact and approximate results on the least size of a graph with a given degree set. 32-42 - Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of cliques in a graph. 43-58 - Tomás Vetrík:
Degree-based function index for graphs with given diameter. 59-70
- Wilder P. Mendes, Simone Dantas, Sylvain Gravier:
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals. 71-81
- Shingo Degawa, Akira Saito:
A note on secure domination in C5-free graphs. 82-83 - Yong-De Feng, Yan-Ting Xie, Lina Wei, Shou-Jun Xu:
A note on characterization of the induced matching extendable Cayley graphs generated by transpositions. 84-89 - Ismael Ríos Villamar, Abel Cabrera Martínez, J. L. Sánchez, José María Sigarreta:
Relating the total {2}-domination number with the total domination number of graphs. 90-95
- Aida Abiad, Cristina Dalfó, Miguel Angel Fiol, Sjanne Zeijlemaker:
On inertia and ratio type bounds for the k-independence number of a graph and their relationship. 96-109 - Xueliang Li, Ning Yang:
Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights. 110-120 - Junming Wang, Qiuzhenyu Tao:
Bounds on Kemeny's constant of trees with a prescribed matching number. 121-131
- Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki:
Note on fair game edge-connectivity of graphs. 132-135
- Robert Scheidweiler, Eberhard Triesch:
Upper and lower bounds for competitive group testing. 136-150
- Josefran de Oliveira Bastos, Carlos Hoppen, Hanno Lefmann, Andy Oertel, Dionatan Ricardo Schmidt:
Graphs with many edge-colorings such that complete graphs are rainbow. 151-164
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-29 00:18 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.
