default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 26
Volume 26, Number 1, September 1997
- Andrei Kotlov:
Rank and chromatic number of a graph. 1-8 - Kathie Cameron, Jack Edmonds:
Lambda composition. 9-16 - Lubomír Soltés:
Nonbipartite graphs with the repeated degree property. 17-25 - Peter Dankelmann, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected graphs and digraphs. 27-34 - Robert E. L. Aldred, Mark N. Ellingham, Robert L. Hemminger, Peter Jipsen:
P3-isomorphisms for graphs. 35-51 - Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall:
Total colorings of planar graphs with large maximum degree. 53-59
Volume 26, Number 2, October 1997
- Kathryn Fraughnaugh, Stephen C. Locke:
Lower bounds on size and independence in K4-free graphs. 61-71 - Anita C. Burris, Richard H. Schelp:
Vertex-distinguishing proper edge-colorings. 73-82 - Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa:
Triangles in 2-factorizations. 83-94 - Hong Wang:
Packing two bipartite graphs into a complete bipartite graph. 95-104 - Hong Wang:
Covering a graph with cycles passing through given edges. 105-109 - Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang:
Signed degree sequences of signed graphs. 111-117
Volume 26, Number 3, November 1997
- Honghui Wan:
Upper bounds for ramsey numbers R(3, 3, ⋖, 3) and Schur numbers. 119-122 - Debra Mullins Strickland:
Building fences around the chromatic coefficients. 123-128 - Niall Cairnie, Keith Edwards:
Some results on the achromatic number. 129-136 - A. Johnson, Fred C. Holroyd, S. Stahl:
Multichromatic numbers, star chromatic numbers and Kneser graphs. 137-145 - Felix Lazebnik, Ping Wang:
On the structure of extremal graphs of high girth. 147-153 - Mohamed H. El-Zahar:
A graph-theoretic version of the union-closed sets conjecture. 155-163 - Béla Bollobás, Andrew Thomason:
On the girth of hamiltonian weakly pancyclic graphs. 165-173
Volume 26, Number 4, December 1997
- Norbert Polat:
End-faithful spanning trees in T1-free graphs. 175-181 - Anthony J. W. Hilton, C. Zhao:
Coloring graphs which have equibipartite complements. 183-194 - Peter C. Fishburn, Paul E. Wright:
Bandwidth edge counts for linear arrangements of rectangular grids. 195-202 - Gregory L. Cherlin, Niandong Shi, Lasse Tallgren:
Graphs omitting a bushy tree. 203-210 - Alasdair Urquhart:
The graph constructions of Hajós and Ore. 211-215
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-12-19 22:13 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:
