default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 332
Volume 332, June 2023
- Milica Milivojevic Danas:
The difference between several metric dimension graph invariants. 1-6 - Letong Hong
, István Miklós:
A Markov chain on the solution space of edge colorings of bipartite graphs. 7-22
- Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The speed and threshold of the biased perfect matching and Hamilton cycle games. 23-40
- Xinying Hua, Kexiang Xu, Hongbo Hua:
Relating the annihilation number and the total domination number for some graphs. 41-46 - Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth:
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences. 47-61 - Eminjan Sabir, Jixiang Meng:
Degree sequence conditions for a graph to be disjoint path coverable. 62-69 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret K. Wagler:
Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs. 70-86 - Kirk Boyer, Paul Horn, Mario Alberto López:
Extremal problems on ray sensor configurations. 87-100 - Yuan Wang, Zhongxun Zhu:
On the eccentric connectivity index of k-uniform hyper-cacti. 101-118 - Joseph Berleant, Kristin Sheridan, Anne Condon, Virginia Vassilevska Williams, Mark Bathe:
Isometric Hamming embeddings of weighted graphs. 119-128 - Stanislav Jendrol', Alfred Onderko:
Brooks-type theorem for r-hued coloring of graphs. 129-134
- Eloi Araujo, Fábio Viduani Martinez, Carlos H. A. Higa, José Soares:
Matrices inducing generalized metric on sequences. 135-154
- Gregory Z. Gutin, Philip R. Neary, Anders Yeo:
Exact capacitated domination: On the computational complexity of uniqueness. 155-169 - Daniel Deza, Shmuel Onn:
Separable and equatable hypergraphs. 170-179
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-09-01 03:25 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.
