default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 294
Volume 294, May 2021
- Che-Nan Kuo
, Yu-Huei Cheng:
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices. 1-9 - Mareike Fischer, Lina Herbst, Michelle Galla, Yangjing Long, Kristina Wicke:
Unrooted non-binary tree-based phylogenetic networks. 10-30 - Soo-Kyung Eom, Hyang-Sook Lee, Seongan Lim, Kyunghwan Song:
Analysis on Yu et al.'s dynamic algorithm for canonic DBC. 31-40 - Jing Chen, Genghua Fan:
Circuit k-covers of signed graphs. 41-54 - Gyula Y. Katona, István Kovács, Kitti Varga:
The complexity of recognizing minimally tough graphs. 55-84 - Joshua Carlson, Jürgen Kritschgau:
Various characterizations of throttling numbers. 85-97 - Mujiangshan Wang, Shiying Wang:
Connectivity and diagnosability of center k-ary n-cubes. 98-107
- Doost Ali Mojdeh, Iztok Peterin, Babak Samadi, Ismael G. Yero:
On three outer-independent domination related parameters in graphs. 115-124 - Alex Alochukwu, Peter Dankelmann:
Distances in graphs of girth 6 and generalised cages. 125-137 - Enes Pasalic, Fengrong Zhang, Sadmir Kudin, Yongzhuang Wei:
Vectorial bent functions weakly/strongly outside the completed Maiorana-McFarland class. 138-151 - Manuel Dubinsky, César Massri, Gabriel Taubin:
Minimum Spanning Tree Cycle Intersection problem. 152-166 - Xiaozheng Chen, Xueliang Li:
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles. 167-180 - Lingjuan Shi, Heping Zhang, Ruizhi Lin:
Characterizing the fullerene graphs with the minimum forcing number 3. 181-204
- Péter L. Erdös, Andrew R. Francis, Tamás Róbert Mezei:
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks. 205-213
- Shoni Gilboa, Shay Gueron:
The advantage of truncated permutations. 214-223
- André Casajus, Michael Kramm:
The dual Lovász extension operator and the Shapley extension operator for TU games. 224-232
- Ilkyoo Choi, Boram Park:
On star 5-colorings of sparse graphs. 233-252
- Asahi Takaoka:
A recognition algorithm for adjusted interval digraphs. 253-256
- Ming Han, Hal A. Kierstead, Xuding Zhu:
Every planar graph is 1-defective (9, 2)-paintable. 257-264 - Qiang Zhu, Fang Ma, Guodong Guo, Dajin Wang:
A new approach to finding the extra connectivity of graphs. 265-271
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-11-18 20:35 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:
