default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 206
Volume 206, June 2016
- Katarína Cechlárová
, Tamás Fleiner, Zsuzsanna Jankó:
House-swapping with divorcing and engaged pairs. 1-8 - Kinkar Chandra Das, Ivan Gutman:
On Wiener and multiplicative Wiener indices of graphs. 9-14 - Aiping Deng, Mengyu Feng, Alexander K. Kelmans:
Adjacency polynomials of digraph transformations. 15-38 - Mitre Costa Dourado, Rudini M. Sampaio:
Complexity aspects of the triangle path convexity. 39-47 - Stefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt:
Intersection graphs of L-shapes and segments in the plane. 48-55 - Walter Hussak:
Disjoint Hamilton cycles in transposition graphs. 56-64 - Sogol Jahanbekam, Jaehoon Kim, Suil O, Douglas B. West:
On r-dynamic coloring of graphs. 65-72 - Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White:
Detour trees. 73-80 - Younjin Kim, Sangjune Lee, Sang-il Oum:
Dynamic coloring of graphs having no K5 minor. 81-89 - Shuchao Li, Yueyu Wu:
On the extreme eccentric distance sum of graphs with some given parameters. 90-99 - Shi-Mei Ma, Toufik Mansour:
Pattern restricted Stirling k-ary words, the plateau statistic and the kernel method. 100-108 - Julián Salas, Vicenç Torra:
Improving the characterization of P-stability for applications in network privacy. 109-114 - Amit Kumar Srivastava, Ananda Chandra Nayak, Kalpesh Kapoor:
On del-robust primitive words. 115-121 - Milan Studený, Tomás Kroupa:
Core-based criterion for extreme supermodular functions. 122-151 - Huihui Zhang, Shuchao Li, Lifang Zhao:
On the further relation between the (revised) Szeged index and the Wiener index of graphs. 152-164 - Xiangqian Zhou, Heping Zhang:
A minimax result for perfect matchings of a polyomino graph. 165-171 - Bao-Xuan Zhu:
Clique cover products and unimodality of independence polynomials. 172-180
- Michael Gentner, Michael A. Henning, Dieter Rautenbach:
Largest domination number and smallest independence number of forests with given degree sequence. 181-187 - Brian G. Kronenthal, Felix Lazebnik:
On the uniqueness of some girth eight algebraically defined graphs. 188-194 - Yijuan Liang, Bo Zhou:
On the distance spread of cacti and bicyclic graphs. 195-202 - Gang Ma, Shengjin Ji, Qiuju Bian, Xia Li:
The maximum matching energy of bicyclic graphs with even girth. 203-210 - Mauro Mezzini:
On the geodetic iteration number of the contour of a graph. 211-214 - Jihui Wang, Jiansheng Cai, Qiaoling Ma:
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles. 215-219
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 2024-10-31 20:16 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:
