|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A survey on conflict-free connection coloring of graphs |
Chang, Hong |
|
352 | C |
p. 88-104 |
article |
|
| 2 | Cubic vertices of minimal bicritical graphs |
Guo, Jing |
|
352 | C |
p. 44-48 |
article |
|
| 3 | Editorial Board |
|
352 | C |
p. ii |
article |
||
| 4 | Forward linearised tree pattern matching using tree pattern border array |
Trávníček, Jan |
|
352 | C |
p. 33-43 |
article |
|
| 5 | Packing K r s in bounded degree graphs |
McKay, Michael |
|
352 | C |
p. 20-32 |
article |
|
| 6 | Query learning algorithm for ordered multi-terminal binary decision diagrams |
Nakamura, Atsuyoshi |
|
352 | C |
p. 69-87 |
article |
|
| 7 | Second neighborhood via probabilistic argument |
Xia, Weihao |
|
352 | C |
p. 49-54 |
article |
|
| 8 | Some sufficient conditions for graphs to be k -leaf-connected |
Liu, Hechao |
|
352 | C |
p. 1-8 |
article |
|
| 9 | Spectral spread and trace norm of eccentricity matrix of graphs |
Rather, Bilal Ahmad |
|
352 | C |
p. 9-19 |
article |
|
| 10 | Succinct data structures for bounded clique-width graphs |
Chakraborty, Sankardeep |
|
352 | C |
p. 55-68 |
article |
10 results found