External Links

    Journal: Graphs and Combinatorics

    Volume 11, Issue 4

    305 -- 317Akira Hiraki, Hiroshi Suzuki, Masayuki Wajima. j, II
    319 -- 326E. Ihrig. Graphs that admit square 1-factorizations are hamiltonian Cayley graphs
    327 -- 335Yoshiyasu Ishigami. Containment problems in high-dimensional spaces
    337 -- 345Jin Xu, Zhenhong Liu. The chromatic polynomial between graph & its complement - about Akiyama and Hararys' open problem
    347 -- 366Rudolf Mathon, Anne Penfold Street. Partitions of sets of two-fold triple systems, and their relation to some strongly regular graphs
    367 -- 378Thomas Niessen. Minimum degree, independence number and regular factors
    379 -- 388Henk Jan Veldman. λ-cycles in 3-cyclable graphs
    389 -- 396Hong Wang. Two vertex-disjoint cycles in a graph

    Volume 11, Issue 3

    209 -- 211Jürgen Bierbrauer. A new family of 4-designs
    213 -- 220Claudson F. Bornstein, Jayme Luiz Szwarcfiter. On clique convergent graphs
    221 -- 231Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak. k-partite graphs
    233 -- 243Hortensia Galeana-Sánchez, Sergio Rajsbaum. Cycle-pancyclism in tournaments I
    245 -- 248Penny E. Haxell. A condition for matchability in hypergraphs
    249 -- 254Ryan B. Hayward. Discs in unbreakable graphs
    255 -- 262George R. T. Hendry, Stephan Brandt. An extremal problem for cycles in hamiltonian graphs
    263 -- 266Leif K. Jørgensen. Critical 3-cochromatic graphs
    267 -- 273Xin Liu. Independent sets, cliques and hamiltonian graphs
    275 -- 283Hideaki Morita. p-groups
    285 -- 291Yee-Hock Peng. Another family of chromatically unique graphs
    293 -- 303Mika Watanabe. Some best possible bounds concerning the traces of finite sets II

    Volume 11, Issue 2

    97 -- 102Darryn E. Bryant, Peter Adams. Decomposing the complete graph into cycles of many lengths
    103 -- 108Laura M. Chihara, Dennis Stanton. A matrix equation for association schemes
    109 -- 120Kiran B. Chilakamarri, Nathaniel Dean. The Ulam number of infinite graphs
    121 -- 129B. Gamble, William R. Pulleyblank, B. Reed, F. Bruce Shepherd. Right angle free subsets in the plane
    131 -- 138Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra. Minimum order of loop networks of given degree and girth
    139 -- 140K. Nomura. A remark on bipartite distance-regular graphs of even valency
    141 -- 170Haruko Okamura. k + 1)-edge-connected graphs
    171 -- 178Bruce Reed, Najiba Sbihi. Recognizing bull-free perfect graphs
    179 -- 199Alexander Sidorenko. What we know and what we do not know about Turán numbers
    201 -- 207Chih-wen Weng. Q-polynomial schemes

    Volume 11, Issue 1

    1 -- 19Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin. r-partite subgraphs
    21 -- 28Ralph J. Faudree, Jan van den Heuvel. k-factors and hamilton cycles in graphs
    29 -- 48Luisa Gargano, János Körner, Ugo Vaccaro. On the capacity of boolean graph formulæ
    49 -- 52Yubao Guo, Lutz Volkmann. A generalization of menger's theorem for certain block - cactus graphs
    53 -- 57Penny E. Haxell. A note on a conjecture of Gallai
    59 -- 67Janice Jeffs, Suzanne M. Seager. n-cycles
    69 -- 90A. Muthusamy, P. Paulraja. Factorizations of product graphs into cycles of uniform length
    91 -- 94Daniel P. Sanders, Yue Zhao. A note on the three color problem
    runs on