default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 11
Volume 11, Number 1, Spring 1987
- P. Katerinis:
Two sufficient conditions for a 2-factor in a bipartite graph. 1-6 - Jing Huang, Weixuan Li:
Toppling kings in a tournament by introducing new kings. 7-11 - Peter J. Cameron
, Amanda G. Chetwynd, John J. Watkins:
Decomposition of snarks. 13-19 - Joseph A. Gallian, David Witte:
When the cartesian product of two directed cycles is hyperhamiltonian. 21-24 - Yair Caro:
Extremal problems concerning transformations of the edges of the complete hypergraphs. 25-37 - R. Taylor:
Note on the reconstruction of vertex colored graphs. 39-42 - Reinhard Diestel:
A separation property of planar triangulations. 43-52 - P. Katerinis:
Maximum matchings in a regular graph of specified connectivity and bounded order. 53-58 - Stephen J. Dow, Douglas F. Rall, Peter J. Slater:
Convex labelings of trees. 59-70 - Andries E. Brouwer, Henk Jan Veldman:
Contractibility and NP-completeness. 71-79 - Pierre Duchet:
A sufficient condition for a digraph to be kernel-perfect. 81-85 - Jason I. Brown, Derek G. Corneil:
On generalized graph colorings. 87-99 - Dan Pritikin:
The bichromaticity of cylinder graphs and torus graphs. 101-111 - K. B. Reid, Keith Wayland:
Minimum path decompositions of oriented cubic graphs. 113-118
Volume 11, Number 2, Summer 1987
- Zbigniew Palka:
Extreme degrees in random graphs. 121-134 - Houria Aït-Djafer:
Linear arboricity for graphs with multiple edges. 135-140 - Branko Grünbaum, Geoffrey C. Shephard:
Edge-transitive planar graphs. 141-155 - Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar:
On the equality of the grundy and ochromatic numbers of a graph. 157-159 - Paul A. Catlin:
Spanning trails. 161-167 - Nian-Zu Li, Earl Glen Whitehead Jr., Shao-Ji Xu:
Classification of chromatically unique graphs having quadratic σ-polynomials. 169-176 - I. P. Goulden, David M. Jackson:
Labelled graphs with vertices of degree at least three. 177-189 - Denis Hanson, Bjarne Toft:
Edge-colored saturated graphs. 191-196 - Douglas R. Woodall:
Subcontraction-equivalence and Hadwiger's conjecture. 197-204 - Jonathan L. Gross, Merrick L. Furst:
Hierarchy for imbedding-distribution invariants of a graph. 205-220 - David W. Bange, Anthony E. Barkauskas, Linda H. Host:
Class-reconstruction of total graphs. 221-230 - Peter M. Winkler:
Every connected graph is a query graph. 231-234 - Yousef Alavi, Gary Chartrand, Fan R. K. Chung, Paul Erdös, Ronald L. Graham, Ortrud R. Oellermann:
Highly irregular graphs. 235-249 - Fan R. K. Chung, Paul Erdös:
On unavoidable hypergraphs. 251-263
Volume 11, Number 3
- Anthony J. W. Hilton, Bill Jackson:
A note concerning the chromatic index of multigraphs. 267-272 - Thomas Andreae:
On the Interval Number of a Triangulated Graph. 273-280 - Wendy J. Myrvold, Mark N. Ellingham, D. G. Hoffman:
Bidegreed graphs are edge reconstructible. 281-302 - Marston D. E. Conder:
A new 5-arc-transitive cubic graph. 303-307 - David S. Johnson, Henry O. Pollak:
Hypergraph planarity and the complexity of drawing venn diagrams. 309-325 - Ioan Tomescu:
On 3-colorings of bipartite p-threshold graphs. 327-338 - Zhang Ke Min:
Longest paths and cycles in bipartite oriented graphs. 339-348 - Robin W. Whitty:
Vertex-disjoint paths and edge-disjoint branchings in directed graphs. 349-358 - Seiya Negami:
The virtual k-factorability of graphs. 359-365 - Noga Alon, Daniel J. Kleitman, Carsten Thomassen, Michael E. Saks, Paul D. Seymour:
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number. 367-371 - George R. T. Hendry:
On the hamiltonian path graph of a graph. 373-384 - Abdelhamid Benhocine, Jean-Luc Fouquet:
Pancyclic and panconnected line graphs. 385-398 - Haitze J. Broersma, Henk Jan Veldman:
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. 399-407 - Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
Diameter increase caused by edge deletion. 409-427 - Ulrich Knauer:
Unretractive and S-unretractive joins and lexicographic products of graphs. 429-440 - Edward R. Scheinerman:
The maximum interval number of graphs with given genus. 441-446 - Jeremy P. Spinrad, Gopalakrishnan Vijayan, Douglas B. West:
An improved edge bound on the interval number of a graph. 447-449
Volume 11, Number 4, Winter 1987
- Gary S. Bloom, Stefan A. Burr:
On unavoidable digraphs in orientations of graphs. 453-462 - Zoltán Füredi:
The number of maximal independent sets in connected graphs. 463-470 - M. V. S. Ramanath, Timothy R. Walsh:
Enumeration and generation of a class of regular digraphs. 471-479 - Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra:
Four classes of perfectly orderable graphs. 481-495 - Crispin St. John Alvah Nash-Williams:
Reconstruction of locally finite connected graphs with at least three infinite wings. 497-505 - Michael D. Plummer, Bjarne Toft:
Cyclic coloration of 3-polytopes. 507-515 - Dan Archdeacon:
A note on defective colorings of graphs in surfaces. 517-519 - Cun-Quan Zhang:
Longest cycles and their chords. 521-529 - Klaus Truemper:
On matroid separations of graphs. 531-536 - Nora Hartsfield:
On regular self-complementary graphs. 537-538 - Ronald C. Read, Guanzhang Hu:
On the construction and enumeration of minimal blocks. 539-553 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Extremal problems involving neighborhood unions. 555-564 - Sin-Min Lee, John Mitchem:
An upper bound for the harmonious chromatic number of a graph. 565-567 - Michele Conforti, Derek Gordon Corneil, Ali Ridha Mahjoub:
Ki-covers. II. Ki-perfect graphs. 569-584 - Erwin Pesch:
Minimal extensions of graphs to absolute retracts. 585-598
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-13 23:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
