Keith Edwards The Harmonious Chromatic Number of Bounded Degree Trees. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:15-28 [Journal]
Zoltán Füredi An Upper Bound on Zarankiewicz' Problem. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:29-33 [Journal]
Tomaz Slivnik Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:91-94 [Journal]
W. T. Gowers An Almost m-wise Independed Random Permutation of the Cube. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:119-130 [Journal]
Valery A. Liskovets Some Asymptotical Estimates for Planar Eulerian Maps. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:131-138 [Journal]
Claudia Neuhauser A Phase Transition for the Distribution of Matching Blocks. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:139-159 [Journal]
C. Cooper Asymptotic Enumeration of Predicate-Junction Flowgraphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:215-226 [Journal]
C. Douglas Howard Orthogonality of Measures Induced by Random Walks with Scenery. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:247-256 [Journal]
Aleksandar Pekec A Winning Strategy for the Ramsey Graph Game. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:267-276 [Journal]
Bruce A. Reed Paths, Stars and the Number Three. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:277-295 [Journal]
Rachid Saad Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:297-306 [Journal]
Konrad Engel Interval Packing and Covering in the Boolean Lattice. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:373-384 [Journal]
Roland Häggkvist Restricted Edge-colourings of Bipartite Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:385-392 [Journal]
Ewa Kubicka An Efficient Method of Examining all Trees. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:403-413 [Journal]
John Shawe-Taylor Fast String Matching in Stationary Ergodic Sources. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:415-427 [Journal]
Zdzislaw Skupien Smallest sets of Longest Paths with Empty Intersection. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:429-436 [Journal]
Carsten Thomassen On the Number of Hamiltonian Cycles in Bipartite Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:437-442 [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
