default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 258
Volume 258, April 2019
- Mingqiang An, Yinan Zhang, Kinkar Chandra Das
, Liming Xiong:
Reciprocal degree distance and graph properties. 1-7 - John Asplund, Randy Davila, Elliot Krop:
A Vizing-type result for semi-total domination. 8-12 - Wayne Barrett, Emily J. Evans, Amanda E. Francis:
Resistance distance in straight linear 2-trees. 13-34 - Kirk Boyer, Boris Brimkov, Sean English, Daniela Ferrero, Ariel Keller, Rachel Kirsch, Michael Phillips, Carolyn Reinhart:
The zero forcing polynomial of a graph. 35-48 - Richard A. Brualdi, Rosário Fernandes, Susana Furtado:
On the Bruhat order of labeled graphs. 49-64 - Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Domination game on uniform hypergraphs. 65-75 - Zhongyuan Che, Karen L. Collins:
An upper bound on Wiener Indices of maximal planar graphs. 76-86 - Samvel Kh. Darbinyan:
Sufficient conditions for Hamiltonian cycles in bipartite digraphs. 87-96 - Mauro Dell'Amico, José Neto:
On total f-domination: Polyhedral and algorithmic results. 97-104 - Shinya Fujita, Michitaka Furuya, Colton Magnant:
General upper bounds on independent k-rainbow domination. 105-113 - Pawel Górecki, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein:
Mathematical properties of the gene duplication cost. 114-122 - Ivan Gutman, José M. Rodríguez, José M. Sigarreta Almira:
Linear and non-linear inequalities on the inverse sum indeg index. 123-134 - Hongbo Hua:
On the peripheral Wiener index of graphs. 135-142 - Shenwei Huang, Tao Li, Yongtang Shi:
Critical (P6, banner)-free graphs. 143-151 - Svante Janson, Robert Kozma, Miklós Ruszinkó, Yury Sokolov:
A modified bootstrap percolation on a random graph coupled with a lattice. 152-165 - Frederick Johnson, Anna Raleigh, Paul S. Wenger, Douglas B. West:
The unit acquisition number of a graph. 166-176 - Ernst J. Joubert:
On a conjecture involving a bound for the total restrained domination number of a graph. 177-187 - Margaux Nattaf, Markó Horváth, Tamás Kis, Christian Artigues, Pierre Lopez:
Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem. 188-203 - Charis Papadopoulos, Spyridon Tzimas:
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs. 204-221 - Sagi Snir, Ben Yohay:
Prokaryotic evolutionary mechanisms accelerate learning. 222-234 - Lutz Volkmann:
The Roman {2}-domatic number of graphs. 235-241 - Minjie Zhang, Shuchao Li, Baogen Xu, Guangfu Wang:
On the minimal eccentric connectivity indices of bipartite graphs with some given parameters. 242-253 - Junlei Zhu, Yuehua Bu:
List r-dynamic coloring of graphs with small maximum average degree. 254-263
- Zhongyuan Che:
A characterization of the resonance graph of an outerplane bipartite graph. 264-268 - Ghurumuruhan Ganesan:
Graph extensions, edit number and regular graphs. 269-275
- Julien Bensmail, Soumen Nandi, Sagnik Sen:
Erratum to "On oriented cliques with respect to push operation" [Discrete Appl. Math. 232 (2017) 50-63]. 276-278
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-09 19:23 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:
