default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 23
Volume 23, Number 1, September 1996
- Noga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich:
On k-saturated graphs with restrictions on the degrees. 1-20 - Cong Fan:
On generalized cages. 21-31 - Xuding Zhu:
Uniquely H-colorable graphs with large girth. 33-41 - David C. Fisher:
Squaring a tournament: A proof of Dean's conjecture. 43-48 - Suohai Fan:
Bipartite graphs and their endomorphism monoids. 49-52 - Géza Tóth:
A ramsey-type bound for rectangles. 53-56 - Lawrence Wargo:
A characterization of α-outerplanar graphs. 57-66 - Ghidewon Abay-Asmerom:
On genus imbeddings of the tensor product of graphs. 67-76 - András Sebö:
The connectivity of minimal imperfect graphs. 77-85 - Leizhen Cai, Derek G. Corneil:
A generalization of perfect graphs - i-perfect graphs. 87-103
Volume 23, Number 2, October 1996
- Jin Ho Kwak, Jaeun Lee:
Enumeration of connected graph coverings. 105-109 - Jirí Sgall:
Solution of a covering problem related to labelled tournaments. 111-118 - Paul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley:
Hypercube subgraphs with minimal detours. 119-128 - Jeff Angel, Ronald Evans:
Diameters of finite upper half plane graphs. 129-137 - Gunnar Brinkmann:
Fast generation of cubic graphs. 139-149 - Jaroslav Nesetril
, Xuding Zhu:
On bounded treewidth duality of graphs. 151-162 - Nathaniel Dean, Robin Thomas, Xingxing Yu:
Spanning paths in infinite planar graphs. 163-174 - Anna Galluccio, Martin Loebl:
(p, q)-odd digraphs. 175-184 - Andrew Kotlov, László Lovász:
The rank and size of graphs. 185-189 - Armen S. Asratian:
Every 3-connected, locally connected, claw-free graph is Hamilton-connected. 191-201 - Frédéric Maffray, Oscar Porto, Myriam Preissmann:
A generalization of simplicial elimination orderings. 203-208 - Hong Wang:
Packing two forests into a bipartite graph. 209-213
Volume 23, Number 3, November 1996
- Hanna D. Robalewska:
2-factors in random regular graphs. 215-224 - Oleg V. Borodin:
Cyclic degree and cyclic coloring of 3-polytopes. 225-231 - Oleg V. Borodin:
Structural theorem on plane graphs with application to the entire coloring number. 233-239 - Genghua Fan, Hal A. Kierstead:
Partitioning a graph into two square-cycles. 241-256 - Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman:
Toughness and longest cycles in 2-connected planar graphs. 257-263 - Daniel P. Sanders:
On the face touching number. 265-271 - Ngo Dac Tan:
Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity. 273-287 - Douglas B. West:
The superregular graphs. 289-295 - Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
An edge coloring problem for graph products. 297-302 - Ralph J. Faudree, András Gyárfás:
Endpoint extendable paths in tournaments. 303-307 - Nancy Eaton, David A. Grable:
Set intersection representations for almost all graphs. 309-320 - Michael Stiebitz:
Decomposing graphs under degree constraints. 321-324
Volume 23, Number 4, December 1996
- Claude Tardif:
On compact median graphs. 325-336 - Paul D. Seymour, Robin Thomas:
Uniqueness of highly representative surface embeddings. 337-349 - Van Bang Le:
Cycle-perfect graphs are perfect. 351-353 - Kara Lee Walcher:
Matching extension in the powers of n-connected graphs. 355-360 - Chiang Lin, Tay-Woei Shyu:
A necessary and sufficient condition for the star decomposition of complete graphs. 361-364 - Walter A. Deuber, Xuding Zhu:
Circular colorings of weighted graphs. 365-376 - Richard P. Anstee:
Dividing a graph by degrees. 377-384 - Rachel Rue:
On covering an independent set in a grid with a second independent set. 385-403 - Jaroslaw Kwapisz:
On the spectral radius of a directed graph. 405-411 - Yusheng Li, Cecil C. Rousseau:
Fan-complete graph Ramsey numbers. 413-420 - Michael F. Bridgland, Robert E. Jamison, Jennifer S. Zito:
The spanning trees forced by the path and the star. 421-441
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:
