John Gimbel Some Remarks on the Convexity Number of a Graph. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:357-361 [Journal]

Akihide Hanaki Characters of Association Schemes and Normal Closed Subsets. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:363-369 [Journal]

Akira Hiraki The Number of Columns (1, k-2, 1) in the Intersection Array of a Distance-Regular Graph. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:371-387 [Journal]

Martin Kochol A Theorem About Elementary Cuts and Flow Polynomials. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:389-392 [Journal]

T. S. Michael, William N. Traves Independence Sequences of Well-Covered Graphs: Non-Unimodality and the Roller-Coaster Conjecture. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:403-411 [Journal]

Xuding Zhu An Analogue of Hajós' Theorem for the Circular Chromatic Number (II). [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:3, pp:419-432 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP