- George R. T. Hendry:
On the hamiltonian path graph of a graph. J. Graph Theory 11(3): 373-384 (1987) - Anthony J. W. Hilton, Bill Jackson:
A note concerning the chromatic index of multigraphs. J. Graph Theory 11(3): 267-272 (1987) - Jing Huang, Weixuan Li:
Toppling kings in a tournament by introducing new kings. J. Graph Theory 11(1): 7-11 (1987) - David S. Johnson, Henry O. Pollak:
Hypergraph planarity and the complexity of drawing venn diagrams. J. Graph Theory 11(3): 309-325 (1987) - P. Katerinis:
Two sufficient conditions for a 2-factor in a bipartite graph. J. Graph Theory 11(1): 1-6 (1987) - P. Katerinis:
Maximum matchings in a regular graph of specified connectivity and bounded order. J. Graph Theory 11(1): 53-58 (1987) - Ulrich Knauer:
Unretractive and S-unretractive joins and lexicographic products of graphs. J. Graph Theory 11(3): 429-440 (1987) - Sin-Min Lee, John Mitchem:
An upper bound for the harmonious chromatic number of a graph. J. Graph Theory 11(4): 565-567 (1987) - Nian-Zu Li, Earl Glen Whitehead Jr., Shao-Ji Xu:
Classification of chromatically unique graphs having quadratic σ-polynomials. J. Graph Theory 11(2): 169-176 (1987) - Zhang Ke Min:
Longest paths and cycles in bipartite oriented graphs. J. Graph Theory 11(3): 339-348 (1987) - Wendy J. Myrvold
, Mark N. Ellingham, D. G. Hoffman:
Bidegreed graphs are edge reconstructible. J. Graph Theory 11(3): 281-302 (1987) - Crispin St. John Alvah Nash-Williams:
Reconstruction of locally finite connected graphs with at least three infinite wings. J. Graph Theory 11(4): 497-505 (1987) - Seiya Negami:
The virtual k-factorability of graphs. J. Graph Theory 11(3): 359-365 (1987) - Zbigniew Palka:
Extreme degrees in random graphs. J. Graph Theory 11(2): 121-134 (1987) - Erwin Pesch:
Minimal extensions of graphs to absolute retracts. J. Graph Theory 11(4): 585-598 (1987) - Michael D. Plummer, Bjarne Toft:
Cyclic coloration of 3-polytopes. J. Graph Theory 11(4): 507-515 (1987) - Dan Pritikin:
The bichromaticity of cylinder graphs and torus graphs. J. Graph Theory 11(1): 101-111 (1987) - M. V. S. Ramanath, Timothy R. Walsh:
Enumeration and generation of a class of regular digraphs. J. Graph Theory 11(4): 471-479 (1987) - Ronald C. Read, Guanzhang Hu:
On the construction and enumeration of minimal blocks. J. Graph Theory 11(4): 539-553 (1987) - K. B. Reid, Keith Wayland:
Minimum path decompositions of oriented cubic graphs. J. Graph Theory 11(1): 113-118 (1987) - Edward R. Scheinerman:
The maximum interval number of graphs with given genus. J. Graph Theory 11(3): 441-446 (1987) - Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
Diameter increase caused by edge deletion. J. Graph Theory 11(3): 409-427 (1987) - Jeremy P. Spinrad, Gopalakrishnan Vijayan, Douglas B. West:
An improved edge bound on the interval number of a graph. J. Graph Theory 11(3): 447-449 (1987) - R. Taylor:
Note on the reconstruction of vertex colored graphs. J. Graph Theory 11(1): 39-42 (1987) - Ioan Tomescu:
On 3-colorings of bipartite p-threshold graphs. J. Graph Theory 11(3): 327-338 (1987) - Klaus Truemper:
On matroid separations of graphs. J. Graph Theory 11(4): 531-536 (1987) - Robin W. Whitty:
Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory 11(3): 349-358 (1987) - Peter M. Winkler:
Every connected graph is a query graph. J. Graph Theory 11(2): 231-234 (1987) - Douglas R. Woodall:
Subcontraction-equivalence and Hadwiger's conjecture. J. Graph Theory 11(2): 197-204 (1987) - Cun-Quan Zhang:
Longest cycles and their chords. J. Graph Theory 11(4): 521-529 (1987)
