| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants
|
Gauci, John Baptist
|
|
|
321 |
C |
p. 126-137
|
article
|
| 2 |
A characterization of well-indumatchable graphs having girth greater than seven
|
Finbow, Arthur S.
|
|
|
321 |
C |
p. 261-271
|
article
|
| 3 |
Acyclic coloring of claw-free graphs with small degree
|
Wang, Juan
|
|
|
321 |
C |
p. 272-280
|
article
|
| 4 |
A generalization of the independence number
|
Katona, Gyula O.H.
|
|
|
321 |
C |
p. 1-3
|
article
|
| 5 |
A note on additive choice number of planar graphs
|
Lai, Hsin-Hao
|
|
|
321 |
C |
p. 357-359
|
article
|
| 6 |
Bounding ℓ -edge-connectivity in edge-connectivity
|
Lin, Xiaoxia
|
|
|
321 |
C |
p. 350-356
|
article
|
| 7 |
Chain method for panchromatic colorings of hypergraphs
|
Akhmejanova, Margarita
|
|
|
321 |
C |
p. 72-81
|
article
|
| 8 |
Colorings with neighborhood parity condition
|
Petruševski, Mirko
|
|
|
321 |
C |
p. 385-391
|
article
|
| 9 |
Complexity of edge monitoring on some graph classes
|
Bagan, Guillaume
|
|
|
321 |
C |
p. 49-63
|
article
|
| 10 |
Decomposition of graphs with constraint on minimum degree
|
Qin, Xiang
|
|
|
321 |
C |
p. 64-71
|
article
|
| 11 |
Degree sums and proper connection number of graphs
|
Wu, Yueyu
|
|
|
321 |
C |
p. 360-367
|
article
|
| 12 |
Editorial Board
|
|
|
|
321 |
C |
p. ii
|
article
|
| 13 |
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance
|
Hong, Yunchao
|
|
|
321 |
C |
p. 147-158
|
article
|
| 14 |
Finding all minimum cost flows and a faster algorithm for the K best flow problem
|
Könen, David
|
|
|
321 |
C |
p. 333-349
|
article
|
| 15 |
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats
|
Hellmuth, Marc
|
|
|
321 |
C |
p. 179-219
|
article
|
| 16 |
Graph r -hued colorings—A survey
|
Chen, Ye
|
|
|
321 |
C |
p. 24-48
|
article
|
| 17 |
On certain trees with the same degree sequence
|
Fernandes, Rosário
|
|
|
321 |
C |
p. 138-146
|
article
|
| 18 |
On forcibly k -connected and forcibly k -arc-connected digraphic sequences
|
Liu, Xuemei
|
|
|
321 |
C |
p. 10-18
|
article
|
| 19 |
On intersecting families of independent sets in trees
|
Hurlbert, Glenn
|
|
|
321 |
C |
p. 4-9
|
article
|
| 20 |
On the difference between proximity and other distance parameters in triangle-free graphs and C 4 -free graphs
|
Dankelmann, Peter
|
|
|
321 |
C |
p. 295-307
|
article
|
| 21 |
On the structure of essentially-highly-connected polyhedral graphs
|
Čekanová, K.
|
|
|
321 |
C |
p. 308-315
|
article
|
| 22 |
On the structure of the inverse of non-singular unicyclic graphs
|
Jaume, Daniel A.
|
|
|
321 |
C |
p. 316-332
|
article
|
| 23 |
On the toll number of a graph
|
Dravec, Tanja
|
|
|
321 |
C |
p. 250-257
|
article
|
| 24 |
Open-end bin packing: New and old analysis approaches
|
Epstein, Leah
|
|
|
321 |
C |
p. 220-239
|
article
|
| 25 |
P 3 -convexity on graphs with diameter two: Computing hull and interval numbers
|
Cappelle, Márcia R.
|
|
|
321 |
C |
p. 368-378
|
article
|
| 26 |
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection
|
Chen, Min-Jen
|
|
|
321 |
C |
p. 19-23
|
article
|
| 27 |
Regular pattern-free coloring
|
Escamocher, Guillaume
|
|
|
321 |
C |
p. 109-125
|
article
|
| 28 |
Remarks on odd colorings of graphs
|
Caro, Yair
|
|
|
321 |
C |
p. 392-401
|
article
|
| 29 |
Rough analysis of computation trees
|
Moshkov, Mikhail
|
|
|
321 |
C |
p. 90-108
|
article
|
| 30 |
State transfers in vertex complemented coronas
|
Wang, Jing
|
|
|
321 |
C |
p. 165-178
|
article
|
| 31 |
Strong edge-coloring of cubic bipartite graphs: A counterexample
|
Cranston, Daniel W.
|
|
|
321 |
C |
p. 258-260
|
article
|
| 32 |
The differential of the line graph L ( G )
|
Basilio, Ludwin A.
|
|
|
321 |
C |
p. 82-89
|
article
|
| 33 |
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
|
Fukuzono, Naoka
|
|
|
321 |
C |
p. 281-294
|
article
|
| 34 |
The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains
|
Qi, Jinfeng
|
|
|
321 |
C |
p. 240-249
|
article
|
| 35 |
The generalized microscopic image reconstruction problem
|
Bar-Noy, Amotz
|
|
|
321 |
C |
p. 402-416
|
article
|
| 36 |
The inclusion-free edge-colorings of ( 3 , Δ ) -bipartite graphs
|
Chen, Lily
|
|
|
321 |
C |
p. 159-164
|
article
|
| 37 |
The outerplanar crossing number of the complete bipartite graph
|
Ábrego, Bernardo M.
|
|
|
321 |
C |
p. 379-384
|
article
|
Journal description