Journals in DBLP
Ding-Zhu Du , D. Frank Hsu , Frank K. Hwang , X. M. Zhang The Hamiltonian property of generalized de Bruijn digraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:1-8 [Journal ] Anthony J. W. Hilton The total chromatic number of nearly complete bipartite graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:9-19 [Journal ] Yoshimi Egawa , R. Glas , Stephen C. Locke Cycles and paths through specified vertices in k -connected graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:20-29 [Journal ] Gena Hahn , Eric C. Milner , Robert E. Woodrow Infinite friendship graphs with infinite parameters. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:30-41 [Journal ] Bert Fassbender On a generalization of a theorem of Nash-Williams. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:42-44 [Journal ] Jason I. Brown , Vojtech Rödl A ramsey type problem concerning vertex colourings. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:45-52 [Journal ] Jan Kratochvíl String graphs. I. The number of critical nonstring graphs is infinite. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:53-66 [Journal ] Jan Kratochvíl String graphs. II. recognizing string graphs is NP-hard. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:67-78 [Journal ] Yair Caro , Zsolt Tuza Hypergraph coverings and local colorings. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:79-85 [Journal ] Igor Kríz , Robin Thomas The menger-like property of the tree-width of infinite graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:86-91 [Journal ] Zsolt Tuza Extensions of Gallai's graph covering theorems for uniform hypergraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:92-96 [Journal ] Jaroslav Ivanco An interpolation theorem for partitions which are indivisible with respect to cohereditary properties. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:97-101 [Journal ] Miroslav Petrovic On graphs with exactly one eigenvalue less than -1. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:102-112 [Journal ] Rephael Wenger Extremal graphs with no C ^{4} 's, C ^{6} 's, or C ^{10} 's. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:113-116 [Journal ] Stanislav Riha A new proof of the theorem by Fleischner. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:117-123 [Journal ] Jozef Sirán , Martin Skoviera Characterization of the maximum genus of a signed graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:124-146 [Journal ] Alice M. Dean , Joan P. Hutchinson , Edward R. Scheinerman On the thickness and arboricity of a graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1991, v:52, n:1, pp:147-151 [Journal ]