Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 17
Volume 17, Number 1, March 1993
- Andrey A. Dobrynin
:
Cubic graphs with 62 vertices having the same path layer matrix. 1-4 - Zhi-Hong Chen:
A degree condition for spanning eulerian subgraphs. 5-21 - Sheshayya A. Choudum:
Edge-chromatic critical graphs and the existence of 1-factors. 23-29 - Miquel A. Fiol:
The connectivity of large digraphs and graphs. 31-45 - Jason Fulman:
A note on the characterization of domination perfect graphs. 47-51 - Alain Hertz, Dominique de Werra:
On the stability number of AH-free graphs. 53-63 - Van Bang Le:
Perfect k-line graphs and k-total graphs. 65-73 - Klaus Dohmen:
Lower bounds and upper bounds for chromatic polynomials. 75-80 - Tony Yu Chang, William Edwin Clark:
The domination numbers of the 5 × n and 6 × n grid graphs. 81-107 - Myung S. Chung, Douglas B. West:
Large P4-free graphs with bounded degree. 109-116 - Jürgen Eckhoff:
Extremal interval graphs. 117-127
Volume 17, Number 2, June 1993
- David R. Guichard:
Acyclic graph coloring and the complexity of the star chromatic number. 129-134 - Jerzy Jaworski, Michal Karonski:
On the connectivity of graphs generated by a sum of random mappings. 135-150 - Peter Horák, He Qing, William T. Trotter:
Induced matchings in cubic graphs. 151-160 - P. Paulraja:
A characterization of Hamiltonian prisms. 161-171 - Alexander Schrijver:
Note on hypergraphs and sphere orders. 173-176 - Noga Alon, Yair Caro:
On three zero-sum Ramsey-type problems. 177-192 - Guantao Chen, Johannes H. Hattingh, Cecil C. Rousseau:
Asymptotic bounds for irredundant and mixed Ramsey numbers. 193-206 - Jan Kärrman:
Existence of proportional graphs. 207-220 - Terry A. McKee, Edward R. Scheinerman:
On the chordality of a graph. 221-232 - Y. H. Peng, T. S. Tay:
On the edge-toughness of a graph. II. 233-246 - Robert L. Hemminger, Xingxing Yu:
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three. 247-252 - Robert E. L. Aldred, Derek A. Holton, Dingjun Lou:
N-extendability of symmetric graphs. 253-261 - Hong-Jian Lai:
Supereulerian complementary graphs. 263-273
Volume 17, Number 3, July 1993
- András Frank, Toshihide Ibaraki, Hiroshi Nagamochi:
On sparse subgraphs preserving connectivity properties. 275-281 - Edward R. Scheinerman:
A note on graphs and sphere orders. 283-289 - Robin J. Chapman, Julie Haviland:
Generalized Rotation numbers. 291-301 - Mingchu Li:
Hamiltonian cycles in 3-connected claw-free graphs. 303-313 - Christoph Stracke, Lutz Volkmann:
A new domination conception. 315-323 - Dasong Cao, Hong Yuan:
Graphs characterized by the second eigenvalue. 325-331 - Daniel Bienstock, Nathaniel Dean:
Bounds for rectilinear crossing numbers. 333-348 - H. L. Abbott, Bing Zhou:
The star chromatic number of a graph. 349-360 - Robert E. L. Aldred, Robert L. Hemminger, Katsuhiro Ota:
The 3-connected graphs having a longest cycle containing only three contractible edges. 361-371 - Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Cycles containing all vertices of maximum degree. 373-385 - Feng Ming Dong:
On chromatic uniqueness of two infinite families of graphs. 387-392 - Martin Juvan, Bojan Mohar:
Laplace eigenvalues and bandwidth-type invariants of graphs. 393-407 - David Eppstein:
Connectivity, graph minors, and subgraph multiplicity. 409-416 - Andrzej Rucinski, Andrew Vince:
The solution to an extremal problem on balanced extensions of graphs. 417-431 - Elizabeth W. McMahon:
On the greedoid polynomial for rooted graphs and rooted digraphs. 433-442
Volume 17, Number 4, September 1993
- Anthony J. W. Hilton:
The existence of k-to-1 continuous maps between graphs when k is sufficiently large. 443-461 - Huaien Li, Yixun Lin:
On the characterization of path graphs. 463-466 - Phillip Botti, Russell Merris:
Almost all trees share a complete set of immanantal polynomials. 467-476 - Marston D. E. Conder:
Hexagon-free subgraphs of hypercubes. 477-479 - Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li:
The complete closure of a graph. 481-494 - Jiuqiang Liu:
Maximal independent sets in bipartite graphs. 495-507 - Gary Chartrand, Garry L. Johns, Songlin Tian, Steven J. Winters:
Directed distance in digraphs: Centers and medians. 509-521 - M. Khalifat, Themistocles Politof, Appajosyula Satyanarayana:
On minors of graphs with at least 3n -4 edges. 523-529 - Jerzy Wojciechowski:
Equitable labelings of cycles. 531-547
Volume 17, Number 5, November 1993
- Carlo Gagliardi, Luigi Grasselli:
Representing products of polyhedra by products of edge-colored graphs. 549-579 - Michael O. Albertson, Lily Chan, Ruth Haas:
Independence and graph homomorphisms graph homomorphisms. 581-588 - Norma Zagaglia Salvi:
A note on the line-distinguishing chromatic number and the chromatic index of a graph. 589-591 - László Lovász, Peter Winkler:
A note on the last new vertex visited by a random walk. 593-596 - Zhi-Hong Chen, Hong-Jian Lai:
Collapsible graphs and matchings. 597-605 - Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp:
Rainbow coloring the cube. 607-612 - Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel:
Generating all 3-connected 4-regular planar graphs from the octahedron graph. 613-620 - Sungpyo Hong, Jin Ho Kwak:
Regular fourfold coverings with respect to the identity automorphism. 621-627 - Wayne Goddard, Daniel J. Kleitman:
A note on maximal triangle-free graphs. 629-631 - David K. Garnick, Y. H. Harris Kwong, Felix Lazebnik:
Extremal graphs without three-cycles or four-cycles. 633-645 - Jean-Claude Bermond, Pavol Hell:
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. 647-655
Volume 17, Number 6, December 1993
- Douglas R. Woodall:
Cyclic-order graphs and Zarankiewicz's crossing-number conjecture. 657-671 - Sanming Zhou:
Disjoint Hamiltonian cycles in fan 2k-type graphs. 673-678 - Martin Erickson:
An upper bound for the Folkman number F(3, 3; 5). 679-681 - Adrian Riskin:
The projective plane crossing number of C3 × Cn. 683-693 - Jerzy Topp, Lutz Volkmann:
Sufficient conditions for equality of connectivity and minimum degree of a graph. 695-700 - Anthony J. W. Hilton, Cheng Zhao:
A sufficient condition for a regular graph to be class 1. 701-712 - Min-Li Yu:
On tree factorizations of Kn. 713-725 - Qing-Xue Huang:
On the minimum number of edge-disjoint complete m-partite subgraphs into which Kn can be decomposed. 727-754 - Gerhard Ringel:
Two trees in maximal planar bipartite graphs. 755-758
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-17 21:34 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:
