default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 6
Volume 6, Number 1, Spring 1982
- Pak-Ken Wong:
Cages - a survey. 1-22 - Charles Payan, Nguyen Huy Xuong:
Domination-balanced graphs. 23-32 - Stanley Fiorini, Josef Lauri:
Edge-reconstruction of 4-connected planar graphs. 33-42 - David L. Powers:
Exceptional trivalent cayley graphs for dihedral groups. 43-55 - André Bouchet:
Constructions of covering triangulations with folds. 57-74 - P. Himelwright, W. D. Wallis, J. E. Williamson:
On one-factorizations of compositions of graphs. 75-80 - Thomas Andreae:
Note on the reconstruction of infinite graphs with a fixed finite number of components. 81-83 - D. Frank Hsu:
Harmonious labelings of windmill graphs and related graphs. 85-87 - Peter J. Slater:
Counterexamples to randić's conjecture on distance degree sequences for trees. 89-92
- François Jaeger, H. Shank:
Erratum: On the edge-coloring problem for a class of 4-regular maps. 93
Volume 6, Number 2, Summer 1982
- Frank Harary:
Homage to roberto frucht. 97-99 - Roberto W. Frucht:
How I became interested in graphs and groups. 101-104 - Günther Malle:
On maximum bipartite subgraphs. 105-113 - Glenn Hopkins, William Staton:
Extremal bipartite subgraphs of cubic triangle-free graphs. 115-121 - Stephen C. Locke
:
Maximum k-colorable subgraphs. 123-132 - Douglas D. Grant, François Jaeger, Charles Payan:
On digraphs without antidirected cycles. 133-138 - Stefan Znám:
On a conjecture of bollobás and bosák. 139-146 - Béla Bollobás:
Vertices of given degree in a random graph. 147-155 - R. J. Cook, D. G. Pryce:
A class of geodetic blocks. 157-168 - Brad Jackson, Torrence D. Parsons:
A shortness exponent for r-regular r-connected graphs. 169-176 - Ian Anderson:
On the toroidal thickness of graphs. 177-184 - Haruko Okamura:
Every simple 3-polytope of order 32 or less is Hamiltonian. 185-196 - Douglas Bauer, Ralph Tindell:
The connectivities of line and total graphs. 197-203 - Stephanie M. Boyles, Geoffrey Exoo:
A counterexample to a conjecture on paths of bounded length. 205-209 - Chris D. Godsil:
Some graphs with characteristic polynomials which are not solvable by radicals. 211-214 - Martin W. Liebeck:
Graphs with nilpotent adjacency matrices. 215-218 - Andrew Thomason:
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable. 219-221
Volume 6, Number 3
- Phyllis Z. Chinn, J. Chvatalova, A. K. Dewdney, Norman E. Gibbs:
The bandwidth problem for graphs and matrices - a survey. 223-254 - T. C. Enns:
4-valent graphs. 255-281 - C. K. Bailey:
Distribution of points by degree and orbit size in a large random tree. 283-293 - Chung-Fan Ma, Mao-Cheng Cai:
The maximum number of arc-disjoint arborescences in a tournament. 295-302 - John W. Moon:
The number of tournaments with a unique spanning cycle. 303-308 - Dale Skrien:
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs. 309-316 - Fred Buckley:
Atoll decompositions of graphs. 317-324 - Ronald C. Read, Doron Rotem, Jorge Urrutia:
Orientations of circle graphs. 325-341 - Nicola Martinov:
Uncontractable 4-connected graphs. 343-344 - K. R. Parthasarathy, S. Sridharan:
On the berge - sauer conjecture. 345-347
Volume 6, Number 4, Winter 1982
- Michal Karonski:
A review of random graphs. 349-389 - Tomaz Pisanski:
Nonorientable genus of cartesian products of regular graphs. 391-402 - Béla Bollobás, Ernest J. Cockayne:
More rotation numbers for complete bipartite graphs. 403-411 - Ronald J. Gould, Michael S. Jacobson:
Bounds for the ramsey number of a disconnected graph versus any graph. 413-417 - Richard Statman:
Topological subgraphs of cubic graphs and a theorem of dirac. 419-427 - Edward F. Schmeichel, John Mitchem:
Bipartite graphs with cycles of all even lengths. 429-439 - Brian Alspach:
A 1-factorization of the line graphs of complete graphs. 441-445 - Norman L. Biggs:
A new 5-arc-transitive cubic graph. 447-451 - J. K. Doyle, Jack E. Graver:
Mean distance for shapes. 453-471 - P. J. Owens:
Cyclically 5-edge-connected cubic planar graphs and shortness coefficients. 473-479 - John Frederick Fink:
Randomly antitraceable digraphs. 481-488 - Sein Win:
A sufficient condition for a graph to contain three disjoint 1-factors. 489-492 - Helge A. Tverberg:
On the decomposition of kn into complete bipartite graphs. 493-494
- Alexander K. Kelmans, M. V. Lomonosov:
A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form". 495-496
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 2026-08-07 21:57 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
