Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             27 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A 7 / 3 -approximation algorithm for feedback vertex set in tournaments via Sherali–Adams Aprile, Manuel

337 C p. 149-160
artikel
2 Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 Sun, Lin

337 C p. 257-271
artikel
3 An old problem of Erdős: A graph without two cycles of the same length Lai, Chunhui

337 C p. 42-45
artikel
4 A note on Seymour’s second neighborhood conjecture Chen, Bin

337 C p. 272-277
artikel
5 Are hitting formulas hard for resolution? Peitl, Tomáš

337 C p. 173-184
artikel
6 A unified construction of weightwise perfectly balanced Boolean functions Zhao, Qinglan

337 C p. 190-201
artikel
7 Bounds for the chromatic index of signed multigraphs Steffen, Eckhard

337 C p. 185-189
artikel
8 Continuous time quantum walks on graphs: Group state transfer Brown, Luke C.

337 C p. 68-80
artikel
9 [ 1 , 2 ] -dimension of graphs Chang, Fei-Huang

337 C p. 232-245
artikel
10 Domination versus edge domination on claw-free graphs Civan, Yusuf

337 C p. 171-172
artikel
11 Eccentricity spectral radius of t -clique trees with given diameter Qiu, Zhengping

337 C p. 202-217
artikel
12 Editorial Board
337 C p. ii
artikel
13 Envy-freeness and relaxed stability for lower-quotas: A parameterized perspective Limaye, Girija

337 C p. 288-302
artikel
14 Factorization and pseudofactorization of weighted graphs Sheridan, Kristin

337 C p. 81-105
artikel
15 Finding biclique partitions of co-chordal graphs Lyu, Bochuan

337 C p. 278-287
artikel
16 How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks Fischer, Mareike

337 C p. 303-320
artikel
17 Locating-dominating sets in local tournaments Bellitto, Thomas

337 C p. 14-24
artikel
18 Matching anti-forcing polynomials of catacondensed hexagonal systems Zhao, Shuang

337 C p. 54-67
artikel
19 On the existence of graphs which can colour every regular graph Mazzuoccolo, Giuseppe

337 C p. 246-256
artikel
20 Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube Jha, Pranava K.

337 C p. 218-231
artikel
21 Path eccentricity of graphs Gómez, Renzo

337 C p. 1-13
artikel
22 Resistance distance in connected balanced digraphs Balakrishnan, R.

337 C p. 46-53
artikel
23 Solution to a conjecture on resistance diameter of lexicographic product of paths Sun, Wensheng

337 C p. 139-148
artikel
24 Solution to a general version of a degree sequence variant of the Erdős–Sós conjecture Zeng, De-Yan

337 C p. 161-170
artikel
25 The iterated local transitivity model for hypergraphs Behague, Natalie C.

337 C p. 106-119
artikel
26 Total k -domination in Cartesian product of complete graphs Carballosa, Walter

337 C p. 25-41
artikel
27 Tridiagonal maximum-entropy sampling and tridiagonal masks Al-Thani, Hessa

337 C p. 120-138
artikel
                             27 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland