Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 14
Volume 14, Number 1, March 1990
- Béla Bollobás:
Almost every graph has reconstruction number three. 1-4 - Charles J. Colbourn, Alexander Rosa:
Repeated edges in 2-factorizations. 5-24 - Felix Lazebnik:
New upper bounds for the greatest number of proper colorings of a (V, E)-graph. 25-29 - Michael B. Dillencourt:
Hamiltonian cycles in planar triangulations with no separating triangles. 31-49 - Herbert Fleischner, Anthony J. W. Hilton, Bill Jackson:
On the maximum number of pairwise compatible euler cycles. 51-63 - Lou Caccetta, Norman J. Pullman:
Regular graphs with prescribed chromatic number. 65-71 - K. S. Poh:
On the linear vertex-arboricity of a planar graph. 73-75 - Hong-Jian Lai:
Reduced graphs of diameter two. 77-87 - Chung-Piaw Teo
, Khee Meng Koh:
The chromaticity of complete bipartite graphs with at most one edge deleted. 89-99 - Ioan Tomescu:
Maximal chromatic polynomials of connected planar graphs. 101-110 - Anne Marie Wilkinson:
Circuits in cayley digraphs of finite abelian groups. 111-116 - Makoto Matsumoto:
Bounds for the vertex linear arboricity. 117-126 - Bill Jackson, Nicholas C. Wormald:
Cycles containing matchings and pairwise compatible euler tours. 127-138
Volume 14, Number 2, June 1990
- Andrey A. Dobrynin:
Regular graphs having the same path layer matrix. 141-148 - Wendy J. Myrvold:
The ally-reconstruction number of a tree with five or more vertices is three. 149-166 - I. Rinsma, C. H. C. Little, Douglas R. Woodall:
Maximal matchings in graphs with large neighborhoods of independent vertices. 167-171 - László Pyber:
The edge reconstruction of hamiltonian graphs. 173-179 - Stephen C. Locke:
A note on bipartite subgraphs of triangle-free regular graphs. 181-185 - Hong-Jian Lai:
The size of strength-maximal graphs. 187-197 - Dan Archdeacon, R. Bruce Richter:
On the parity of planar covers. 199-204 - Ewa Wojcicka:
Hamiltonian properties of domination-critical graphs. 205-215 - Tomasz Luczak:
The phase transition in the evolution of random digraphs. 217-223 - Thomas Niessen, Lutz Volkmann:
Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree. 225-246 - Michael O. Albertson, David M. Berman, Joan P. Hutchinson, Carsten Thomassen:
Graphs with homeomorphically irreducible spanning trees. 247-258 - J. Adrian Bondy:
Perfect path double covers of graphs. 259-272
Volume 14, Number 3, July 1990
- B. Devadas Acharya, Suresh Manjanath Hegde:
Arithmetic graphs. 275-299 - Bojan Mohar, Tomaz Pisanski, Arthur T. White:
Embeddings of cartesian products of nearly bipartite graphs. 301-310 - Jo Heath, Anthony J. W. Hilton:
Trees that admit 3-to-1 maps onto the circle. 311-320 - Zdenek Ryjácek:
Hamiltonian circuits in N2-locally connected K1, 3-free graphs. 321-331 - Jason I. Brown, Derek G. Corneil, Ali Ridha Mahjoub:
A note on Ki-perfect graphs. 333-340 - D. A. Chalcraft:
Certain graph invariants do not distinguish all graphs. 341-346 - Paul A. Catlin, Iqbalunnisa T. N. Janakiraman, N. Srinivasan:
Hamilton cycles and closed trails in iterated line graphs. 347-364 - Russell Merris:
The distance spectrum of a tree. 365-369 - Jørgen Bang-Jensen:
Locally semicomplete digraphs: A generalization of tournaments. 371-390 - Bor-Liang Chen, Ko-Wei Lih:
Diameters of iterated clique graphs of chordal graphs. 391-396
Volume 14, Number 4, September 1990
- François Jaeger, Gerhard Koester:
Vertex signatures and edge-4-colorings of 4-regular plane graphs. 399-403 - John Frederick Fink:
On the decomposition of n-cubes into isomorphic trees. 405-411 - Claude Benzaken, Yves Crama, Pierre Duchet, Peter L. Hammer, Frédéric Maffray:
More characterizations of triangulated graphs. 413-422 - Gerhard Behrendt:
Automorphism groups of pictures. 423-426 - Peter Damaschke:
Induced subgraphs and well-quasi-ordering. 427-435 - Johannes H. Hattingh:
On irredundant Ramsey numbers for graphs. 437-441 - Fan R. K. Chung:
Universal graphs and induced-universal graphs. 443-454 - Gábor Bacsó, Zsolt Tuza:
A characterization of graphs without long induced paths. 455-464 - Derek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald:
Removable edges in 3-connected graphs. 465-473 - Edward A. Bender, L. Bruce Richmond:
3-edge-connected embeddings have few singular edges. 475-477 - J. Adrian Bondy, Pavol Hell:
A note on the star chromatic number. 479-482 - Richard A. Brualdi, Bolian Liu:
Generalized exponents of primitive directed graphs. 483-499 - Guantao Chen:
One sufficient condition for hamiltonian graphs. 501-508 - Robert A. Beezer:
Trees with very few eigenvalues. 509-517
Volume 14, Number 5, November 1990
- Bogdan Oporowski:
A counterexample to Seymour's self-minor conjecture. 521-524 - Kathryn Fraughnaugh Jones:
Size and independence in triangle-free graphs with maximum degree three. 525-535 - Cun-Quan Zhang:
Minimum cycle coverings and integer flows. 537-546 - Graham R. Brightwell, Peter Winkler:
Extremal cover times for random walks on trees. 547-554 - Vasek Chvátal:
Which line-graphs are perfectly orderable? 555-558 - Adalbert Kerber, Reinhard Laue, Ralf Hager, Wolfgang Weber:
Cataloging graphs by generating them uniformly at random. 559-563 - Odile Marcotte, Paul D. Seymour:
Extending an edge-coloring. 565-573 - Katherine Heinrich:
Coloring the edges of km × km. 575-583 - Ortrud R. Oellermann, Songlin Tian:
Steiner centers in graphs. 585-597 - László Babai, Miklós Simonovits, Joel Spencer:
Extremal subgraphs of random graphs. 599-622 - Mikio Kano, Svatopluk Poljak:
Graphs with the balas - uhry property. 623-628
Volume 14, Number 6, December 1990
- Ondrej Zýka:
On the bipartite density of regular graphs with large girth. 631-634 - Akira Saito:
Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets. 635-643 - Hao Li:
Perfect path double covers in every simple graph. 645-650 - Noga Alon:
Ramsey graphs cannot be defined by real polynomials. 651-661 - M. Burzio, D. C. Demaria:
Hamiltonian tournaments with the least number of 3-cycles. 663-672 - John Sheehan:
Balanced graphs with edge density constraints. 673-685 - Miguel Angel Fiol, José Luis Andres Yebra:
Dense bipartite digraphs. 687-700 - Oleg V. Borodin:
Diagonal 11-coloring of plane triangulations. 701-704 - Xingxing Yu:
Trees and unicyclic graphs with hamiltonian path graphs. 705-708 - David Hartvigsen:
Path-isomorphic networks. 709-722 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Lower bounds for lower Ramsey numbers. 723-730
a service of 
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-04-22 20:03 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
