


default search action
Theoretical Computer Science, Volume 799
Volume 799, December 2019
- Giordano Da Lozzo

, Ignaz Rutter
:
Planarity of streamed graphs. 1-21 - Eminjan Sabir

, Aygul Mamut, Elkin Vumar:
The extra connectivity of the enhanced hypercubes. 22-31 - Hadi Rahbani, Nader Jafari Rad

, Mohammad-Reza Sadeghi
:
A note on the complexity of locating-total domination in graphs. 32-39 - Endre Boros

, Vladimir Gurvich, Nhan Bao Ho, Kazuhisa Makino, Peter Mursic
:
Sprague-Grundy function of matroids and related hypergraphs. 40-58 - Shunzhe Zhang

, Huiqing Liu, Xiaolan Hu:
Hybrid fault diagnosis capability analysis of triangle-free graphs. 59-70 - Oscar H. Ibarra, Ian McQuillan

:
On families of full trios containing counter machine languages. 71-93 - Mei-Mei Gu

, Shengjie He, Rong-Xia Hao, Eddie Cheng:
Strongly Menger connectedness of data center network and (n, k)-star graph. 94-103 - Runjie Miao

, Jinjiang Yuan, Fei Huang:
Paths and trails in edge-colored weighted graphs. 104-114 - Muhammad Murtaza

, Muhammad Fazil, Imran Javaid:
Locating-dominating sets of functigraphs. 115-123 - Titus Dose:

Balance problems for integer circuits. 124-139 - James D. Currie, Tero Harju

, Pascal Ochem, Narad Rampersad:
Some further results on squarefree arithmetic progressions in infinite words. 140-148 - Ulrich Pferschy, Gaia Nicosia

, Andrea Pacifici
:
A Stackelberg knapsack game with weight control. 149-159

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














