Journals in DBLP
Shreeram S. Abhyankar , Ikkwon Yie Small degree coverings of the affine line in characteristic two. [Citation Graph (0, 0)][DBLP ] Journal ] Shreeram S. Abhyankar , Jun Ou , Avinash Sathaye Alternating group coverings of the affine line for characteristic two. [Citation Graph (0, 0)][DBLP ] Journal ] Ahmed M. Assaf Bipacking pairs by quintuples: The case nu=13 (mod 20). [Citation Graph (0, 0)][DBLP ] Journal ] Frank W. Barnes How many 1×2×4 bricks can you get into an odd box? [Citation Graph (0, 0)][DBLP ] Journal ] Luigi Cerlienco , Marina Mureddu Generalized Robinson-Schensted correspondences: a new algorithm. [Citation Graph (0, 0)][DBLP ] Journal ] Mark N. Ellingham , Robert L. Hemminger , Kathryn E. Johnson Contractible edges in longest cycles in non-Hamiltonian graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Winfried Geyer On Tamari lattices. [Citation Graph (0, 0)][DBLP ] Journal ] Robert B. Hughes Lower bounds on cube simplexity. [Citation Graph (0, 0)][DBLP ] Journal ] Alexander V. Ivashchenko Some properties of contractible transformations on graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Zygmunt Jackowski Characterizations of two classes of digraphs. [Citation Graph (0, 0)][DBLP ] Journal ] Ming Jiang , Frank Ruskey Determining the hamilton-connectedness of certain vertex-transitive graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Hiroshi Kimura Classification of Hadamard matrices of order 28. [Citation Graph (0, 0)][DBLP ] Journal ] R. Klein On the colorability of m-composed graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Jan Kratochvíl Regular codes in regular graphs are difficult. [Citation Graph (0, 0)][DBLP ] Journal ] Eric Mendelsohn , P. Rodney The existence of court balanced tournament designs. [Citation Graph (0, 0)][DBLP ] Journal ] David J. Rasmussen , Carla D. Savage Hamilto-connected derangement graphs on S n. [Citation Graph (0, 0)][DBLP ] Journal ] James H. Schmerl Tiling space with notched cubes. [Citation Graph (0, 0)][DBLP ] Journal ] Marcin J. Schroeder Dependence systems with the operator-image exchange property. [Citation Graph (0, 0)][DBLP ] Journal ] Yongbing Shi The number of cycles in a hamilton graph. [Citation Graph (0, 0)][DBLP ] Journal ] B. Uhrin The set of neighbours of a set in a point-lattice. [Citation Graph (0, 0)][DBLP ] Journal ] Shaoji Xu Classes of chromatically equivalent graphs and polygon trees. [Citation Graph (0, 0)][DBLP ] Journal ] Horst Alzer An inequality for increasing sequences and its integral analogue. [Citation Graph (0, 0)][DBLP ] Journal ] Paul L. Check , Charles J. Colbourn Concerning difference families with block size four. [Citation Graph (0, 0)][DBLP ] Journal ] D. Frank Hsu , Tomasz Luczak On the k-diameter of k-regular k-connected graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Sandi Klavzar , Uros Milutinovic Strong products of Kneser graphs. [Citation Graph (0, 0)][DBLP ] Journal ] Anping Li On the conjecture at two counterfeit coins. [Citation Graph (0, 0)][DBLP ] Journal ] Hunter S. Snevily The snake-in-the-box problem: A new upper bound. [Citation Graph (0, 0)][DBLP ] Journal ] Jun-Ming Xu A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. [Citation Graph (0, 0)][DBLP ] Journal ] Min Song Zeng , Zhang Ke Min Neighborhood unions and Hamiltonian properties. [Citation Graph (0, 0)][DBLP ] Journal ] Ke Min Zhang , Yannis Manoussakis , Zeng Min Song Complementary cycles containing a fixed arc in diregular bipartite tournaments. [Citation Graph (0, 0)][DBLP ] Journal ] 