default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 268
Volume 268, September 2019
- Julien Bensmail, Jakub Przybylo
:
Decomposability of graphs into subgraphs fulfilling the 1-2-3 Conjecture. 1-9 - Franz J. Brandenburg:
Characterizing 5-map graphs by 2-fan-crossing graphs. 10-20 - Arthur H. Busch, R. Sritharan:
Some completion problems for graphs without chordless cycles of prescribed lengths. 21-34 - Peter Dankelmann:
The Steiner k-Wiener index of graphs with given minimum degree. 35-43 - Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki:
Exhaustive generation for permutations avoiding (colored) regular sets of patterns. 44-53 - Paolo Dulio, Silvia M. C. Pagani:
A rounding theorem for unique binary tomographic reconstruction. 54-69 - Ernesto Estrada:
Rethinking structural balance in signed social networks. 70-90 - Hilal A. Ganie, Bilal A. Chat:
Bounds for the energy of weighted graphs. 91-101 - Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez:
Maximum eccentric connectivity index for graphs with given diameter. 102-111 - Ziwen Huang, Runrun Liu, Gaozhen Wang:
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph. 112-118 - Bogumil Kaminski, Pawel Pralat:
Sub-trees of a random tree. 119-129 - Xin Li, Ji-Ming Guo:
No graph with nullity η(G)=|V(G)|-2m(G)+2c(G)-1. 130-136 - Atílio G. Luiz, C. N. Campos, R. Bruce Richter:
On α-labellings of lobsters and trees with a perfect matching. 137-151 - Keju Meng, Fuyou Miao, Wenchao Huang, Yan Xiong:
Tightly coupled multi-group threshold secret sharing based on Chinese Remainder Theorem. 152-163 - Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye:
Gallai-Ramsey numbers for books. 164-177
- Arnaud Mary, Vincent Limouzy, Lhouari Nourine:
WEPA 2016 preface. 178 - Florent Capelli, Yann Strozecki:
Incremental delay enumeration: Space and time. 179-190 - Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer:
A complexity theory for hard enumeration problems. 191-209 - Alessio Conte, Roberto Grossi, Andrea Marino, Lorenzo Tattini, Luca Versari:
A fast discovery algorithm for large common connected induced subgraphs. 210-222 - Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu, Shun-Chieh Chang:
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. 223-236
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-12 21:45 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:
