|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
28 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Algorithmic aspects of open neighborhood location–domination in graphs |
Panda, B.S. |
2017 |
216 | P1 |
p. 290-306 17 p. |
article |
|
| 2 | A new LBFS-based algorithm for cocomparability graph recognition |
Dusart, Jérémie |
2017 |
216 | P1 |
p. 149-161 13 p. |
article |
|
| 3 | A sufficient condition to extend polynomial results for the Maximum Independent Set Problem |
Mosca, Raffaele |
2017 |
216 | P1 |
p. 281-289 9 p. |
article |
|
| 4 | Characterization and recognition of some opposition and coalition graph classes |
Le, Van Bang |
2017 |
216 | P1 |
p. 261-272 12 p. |
article |
|
| 5 | Characterizing width two for variants of treewidth |
Bodlaender, Hans L. |
2017 |
216 | P1 |
p. 29-46 18 p. |
article |
|
| 6 | Complexity of coloring graphs without paths and cycles |
Hell, Pavol |
2017 |
216 | P1 |
p. 211-232 22 p. |
article |
|
| 7 | Contents |
2017 |
216 | P1 |
p. v-vi nvt p. |
article |
||
| 8 | Ferrers dimension of grid intersection graphs |
Chaplick, Steven |
2017 |
216 | P1 |
p. 130-135 6 p. |
article |
|
| 9 | Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detection |
Cao, Yixin |
2017 |
216 | P1 |
p. 67-83 17 p. |
article |
|
| 10 | Graph editing to a fixed target |
Golovach, Petr A. |
2017 |
216 | P1 |
p. 181-190 10 p. |
article |
|
| 11 | Graph isomorphism for graph classes characterized by two forbidden induced subgraphs |
Kratsch, Stefan |
2017 |
216 | P1 |
p. 240-253 14 p. |
article |
|
| 12 | Graphs with maximal induced matchings of the same size |
Baptiste, Philippe |
2017 |
216 | P1 |
p. 15-28 14 p. |
article |
|
| 13 | Maximum weight independent sets in classes related to claw-free graphs |
Karthick, T. |
2017 |
216 | P1 |
p. 233-239 7 p. |
article |
|
| 14 | Max point-tolerance graphs |
Catanzaro, Daniele |
2017 |
216 | P1 |
p. 84-97 14 p. |
article |
|
| 15 | Minimal dominating sets in interval graphs and trees |
Golovach, Petr A. |
2017 |
216 | P1 |
p. 162-170 9 p. |
article |
|
| 16 | Morphological filtering on hypergraphs |
Sebastian Vadakkenveettil, Bino |
2017 |
216 | P1 |
p. 307-320 14 p. |
article |
|
| 17 | New results on word-representable graphs |
Collins, Andrew |
2017 |
216 | P1 |
p. 136-141 6 p. |
article |
|
| 18 | On color-critical ( P 5 ,co- P 5 )-free graphs |
Dhaliwal, Harjinder S. |
2017 |
216 | P1 |
p. 142-148 7 p. |
article |
|
| 19 | On equistable, split, CIS, and related classes of graphs |
Boros, Endre |
2017 |
216 | P1 |
p. 47-66 20 p. |
article |
|
| 20 | On neighborhood-Helly graphs |
Groshaus, Marina |
2017 |
216 | P1 |
p. 191-202 12 p. |
article |
|
| 21 | On recognition of threshold tolerance graphs and their complements |
Golovach, Petr A. |
2017 |
216 | P1 |
p. 171-180 10 p. |
article |
|
| 22 | Preface: Special graph classes and algorithms–in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday |
Dragan, Feodor F. |
2017 |
216 | P1 |
p. 1- 1 p. |
article |
|
| 23 | Rainbow colouring of split graphs |
Chandran, L. Sunil |
2017 |
216 | P1 |
p. 98-113 16 p. |
article |
|
| 24 | Reconstructing trees from digitally convex sets |
Lafrance, Philip |
2017 |
216 | P1 |
p. 254-260 7 p. |
article |
|
| 25 | Thin strip graphs |
Hayashi, Takashi |
2017 |
216 | P1 |
p. 203-210 8 p. |
article |
|
| 26 | Threshold-coloring and unit-cube contact representation of planar graphs |
Alam, Md. Jawaherul |
2017 |
216 | P1 |
p. 2-14 13 p. |
article |
|
| 27 | Treewidth and Pathwidth parameterized by the vertex cover number |
Chapelle, Mathieu |
2017 |
216 | P1 |
p. 114-129 16 p. |
article |
|
| 28 | Vertex coloring of graphs with few obstructions |
Lozin, V.V. |
2017 |
216 | P1 |
p. 273-280 8 p. |
article |
28 results found