Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices (Englisch)
- Neue Suche nach: Kuo, Che-Nan
- Weitere Informationen zu Kuo, Che-Nan:
- https://orcid.org/0000-0001-7705-4208
- Neue Suche nach: Cheng, Yu-Huei
- Weitere Informationen zu Cheng, Yu-Huei:
- https://orcid.org/0000-0002-1468-6686
- Neue Suche nach: Kuo, Che-Nan
- Neue Suche nach: Cheng, Yu-Huei
In:
Discrete Applied Mathematics
;
294
;
1-9
;
2021
-
ISSN:
- Aufsatz (Zeitschrift) / Elektronische Ressource
-
Titel:Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices
-
Beteiligte:Kuo, Che-Nan ( Autor:in ) / Cheng, Yu-Huei ( Autor:in )
-
Erschienen in:Discrete Applied Mathematics ; 294 ; 1-9
-
Verlag:
- Neue Suche nach: Elsevier B.V.
-
Erscheinungsdatum:27.01.2021
-
Format / Umfang:9 pages
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Datenquelle:
Inhaltsverzeichnis – Band 294
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent verticesKuo, Che-Nan / Cheng, Yu-Huei et al. | 2021
- 10
-
Unrooted non-binary tree-based phylogenetic networksFischer, Mareike / Herbst, Lina / Galla, Michelle / Long, Yangjing / Wicke, Kristina et al. | 2021
- 31
-
Analysis on Yu et al.’s dynamic algorithm for canonic DBCEom, Sookyung / Lee, Hyang-Sook / Lim, Seongan / Song, Kyunghwan et al. | 2021
- 41
-
Circuit -covers of signed graphsChen, Jing / Fan, Genghua et al. | 2021
- 55
-
The complexity of recognizing minimally tough graphsKatona, Gyula Y. / Kovács, István / Varga, Kitti et al. | 2021
- 85
-
Various characterizations of throttling numbersCarlson, Joshua / Kritschgau, Jürgen et al. | 2021
- 98
-
Connectivity and diagnosability of center -ary -cubesWang, Mujiangshan / Wang, Shiying et al. | 2021
- 108
-
Edge-disjoint paths in faulty augmented cubesMa, Meijie / Yu, Jiguo et al. | 2021
- 115
-
On three outer-independent domination related parameters in graphsMojdeh, Doost Ali / Peterin, Iztok / Samadi, Babak / Yero, Ismael G. et al. | 2021
- 125
-
Distances in graphs of girth 6 and generalised cagesAlochukwu, Alex / Dankelmann, Peter et al. | 2021
- 138
-
Vectorial bent functions weakly/strongly outside the completed Maiorana–McFarland classPasalic, E. / Zhang, F. / Kudin, S. / Wei, Y. et al. | 2021
- 152
-
Minimum Spanning Tree Cycle Intersection problemDubinsky, Manuel / Massri, César / Taubin, Gabriel et al. | 2021
- 167
-
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic trianglesChen, Xiaozheng / Li, Xueliang et al. | 2021
- 181
-
Characterizing the fullerene graphs with the minimum forcing number 3Shi, Lingjuan / Zhang, Heping / Lin, Ruizhi et al. | 2021
- 205
-
Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networksErdős, Péter L. / Francis, Andrew / Mezei, Tamás Róbert et al. | 2021
- 214
-
The advantage of truncated permutationsGilboa, Shoni / Gueron, Shay et al. | 2021
- 224
-
The dual Lovász extension operator and the Shapley extension operator for TU gamesCasajus, André / Kramm, Michael et al. | 2021
- 233
-
On star 5-colorings of sparse graphsChoi, Ilkyoo / Park, Boram et al. | 2021
- 253
-
A recognition algorithm for adjusted interval digraphsTakaoka, Asahi et al. | 2021
- 257
-
Every planar graph is 1-defective -paintableHan, Ming / Kierstead, H.A. / Zhu, Xuding et al. | 2021
- 265
-
A new approach to finding the extra connectivity of graphsZhu, Qiang / Ma, Fang / Guo, Guodong / Wang, Dajin et al. | 2021
- ii
-
Editorial Board| 2021