default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 5
Volume 5, Number 1, Spring 1981
- Jean-Claude Bermond, Carsten Thomassen:
Cycles in digraphs- a survey. 1-43 - Mike Plantholt:
The chromatic index of graphs with a spanning star. 45-53 - Brad Jackson, Torrence D. Parsons, Tomaz Pisanski:
A duality theorem for graph embeddings. 55-77 - M. O'Keefe, P. K. Wong:
The smallest graph of girth 6 and valency 7. 79-85 - Tatsuro Ito:
On a graph of O'Keefe and wong. 87-94 - Richard William Decker, Henry H. Glover, John Philip Huneke:
The genus of the 2-amalgamations of graphs. 95-102 - Jin Akiyama, Frank Harary:
A graph and its complement with specified properties. IV. Counting self-complementary blocks. 103-107 - Fan R. K. Chung:
A note on constructive methods for ramsey numbers. 109-113 - Valery A. Liskovets
:
Enumeration of nonisomorphic planar maps. 115-117
Volume 5, Number 2, Summer 1981
- Thomas Andreae:
On the reconstruction of locally finite trees. 123-135 - Chris D. Godsil, Ivan Gutman:
On the theory of the matching polynomial. 137-144 - Bill Jackson:
Long paths and cycles in oriented graphs. 145-157 - Hian Poh Yap:
A construction of chromatic index critical graphs. 159-163 - Alain Billionnet:
An upper bound on the size of the largest cliques in a graph. 165-169 - Robert J. Kimble Jr., Allen J. Schwenk, Paul K. Stockmeyer:
Pseudosimilar vertices in a graph. 171-181 - Ronald C. Read, Nicholas C. Wormald:
Counting the 10-point graphs by partition. 183-196 - Joseph B. Klerlein, A. Gregory Starling:
Hamiltonian groups are color-graph-hamiltonian. 197-199 - Derek F. Holt:
A graph which is edge transitive but not arc transitive. 201-204 - Ladislav Nebesky:
Every connected, locally connected graph is upper embeddable. 205-207 - Dom Decaen:
A note on path and cycle decompositions of graphs. 209-211 - Sergio Ruiz:
On strongly regular self - complementary graphs. 213-215
Volume 5, Number 3, Fall 1981
- Frank Harary:
Homage to the memory of Kazimierz Kuratowski. 217-219 - J. Krasinkiewicz:
A note on the work and life of Kazimierz Kuratowski. 221-223 - Carsten Thomassen:
Kuratowski's theorem. 225-241 - Dan Archdeacon:
A Kuratowski theorem for the projective plane. 243-246 - Dominique de Werra:
On the existence of generalized good and equitable edge colorings. 247-258 - Alexander K. Kelmans:
A new planarity criterion for 3-connected graphs. 259-267 - François Jaeger, H. Shank:
On the edge-coloring problem for a class of 4-regular maps. 269-275 - M. L. Gardner:
The λ-complete multigraphs. 277-283 - Chris D. Godsil:
Matchings and walks in graphs. 285-297 - Zevi Miller, Heinrich Müller:
Chromatic numbers of hypergraphs and coverings of graphs. 299-305 - Richard A. Brualdi, Robert F. Shanny:
Hamiltonian line graphs. 307-314 - Curtis A. Barefoot, Roger C. Entringer:
A census of maximum uniquely hamiltonian graphs. 315-321 - Edward Howorka:
A characterization of ptolemaic graphs. 323-331 - A. Pawel Wojda:
Meyniel's theorem for strongly (p, q) - Hamiltonian digraphs. 333-335 - Thomas W. Tucker:
Some results on the genus of a group. 337-338
Volume 5, Number 4, Winter 1981
- Karl Menger:
On the origin of the n-arc theorem. 341-350 - Carsten Thomassen:
Nonseparating cycles in K-Connected graphs. 351-354 - Ian Anderson:
Quadrilateral embeddings of bipartite graphs. 355-361 - Albert D. Polimeni, H. Joseph Straight, Jay Yellen:
Some arrowing results for trees versus complete graphs. 363-369 - Geoffrey Exoo:
On an adjacency property of graphs. 371-378 - Vinay G. Kane, Shreedhara Prasada Mohanty, Ernst G. Straus:
Which rational numbers are binding numbers? 379-384 - Dragos M. Cvetkovic, Michael Doob, Slobodan K. Simic:
Generalized line graphs. 385-399 - Thomas Zaslavsky:
Characterizations of signed graphs. 401-406 - Gustavus J. Simmons:
Maximal non- hamilton-laceable graphs. 407-415 - Andrew Vince:
Locally homogeneous graphs from groups. 417-422 - Jenö Lehel:
Generating all 4-regular planar graphs from the graph of the octahedron. 423-426 - Fred Buckley, Zevi Miller, Peter J. Slater:
On graphs containing a given graph as center. 427-434 - Andreas Blass, Geoffrey Exoo, Frank Harary:
Paley graphs satisfy all first-order adjacency axioms. 435-439 - Carsten Thomassen:
A remark on the factor theorems of lovász and tutte. 441-442 - Chong-Keang Lim, Yee-Hock Peng:
On Graphs Without Multicliqual Edges. 443-451
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-10-31 20:05 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:
