Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 15
Volume 15, Number 1, March 1991
- Qingxue Huang:
On the decomposition of Kn into complete m-partite graphs. 1-6 - Yair Caro, Ilia Krasikov, Yehuda Roditty:
On the largest tree of given maximum degree in a connected graph. 7-13 - A. F. Sidorenko:
An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G. 15-17 - Xingxing Yu:
On the cycle-isomorphism of graphs. 19-27 - Haitze J. Broersma
, Henk Jan Veldman:
Long dominating cycles and paths in graphs with large neighborhood unions. 29-38 - Odile Favaron, Maryvonne Mahéo, Jean-François Saclé:
On the residue of a graph. 39-64 - Stephan Olariu:
On the homogeneous representation of interval graphs. 65-80 - Tom Madej:
Bounds for the crossing number of the N-cube. 81-97 - Yair Caro, Zsolt Tuza:
Improved lower bounds on k-independence. 99-107
Volume 15, Number 2, June 1991
- Igor E. Zverovich, Vadim E. Zverovich:
A characterization of domination perfect graphs. 109-114 - Nadimpalli V. R. Mahadev, Uri N. Peled:
On a conjecture of wang and williams. 115-120 - Ronald J. Gould:
Updating the hamiltonian problem - A survey. 121-157 - Jonathan L. Gross, Robert G. Rieper:
Local extrema in genus-stratified graphs. 159-171 - Fan R. K. Chung, Ronald L. Graham:
Quasi-random tournaments. 173-198 - Shigeru Kitakubo:
Bounding the number of embeddings of 5-connected projective-planar graphs. 199-205 - Jennifer S. Zito:
The structure and maximum number of maximum independent sets in trees. 207-221 - Gerard Sierksma, Han Hoogeveen:
Seven criteria for integer sequences being graphic. 223-231
Volume 15, Number 3, July 1991
- Chi Wang, A. C. Williams:
The threshold weight of a graph. 235-249 - Peter Avery:
Score sequences of oriented graphs. 251-257 - Sheshayya A. Choudum, M. S. Paulraj:
Regular factors in K1, 3-free graphs. 259-265 - Xiaotie Deng, Christos H. Papadimitriou:
On path lengths modulo three. 267-282 - Mao-Cheng Cai:
[a, b]-factorizations of graphs. 283-301 - Tomasz Luczak:
How to deal with unlabeled random graphs. 303-316 - Sharad Chaudhary, Gary Gordon:
Tutte polynomials for trees. 317-331 - Claude Berge, Jean-Claude Fournier:
A short proof for a generalization of Vizing's theorem. 333-336 - Yoshimi Egawa, Katsuhiro Ota:
Regular factors in K1, n free graphs. 337-344
Volume 15, Number 4, September 1991
- Zhikang Lu:
On an upper bound for the harmonious chromatic number of a graph. 345-347 - Stephan Olariu:
On the structure of unbreakable graphs. 349-373 - Brian Alspach, C. C. Chen, Katherine Heinrich:
Characterization of a class of triangle-free graphs with a certain adjacency property. 375-388 - André E. Kézdy, Patrick McGuinness:
Do 3n - 5 edges force a subdivision of K5? 389-406 - Neil Robertson, Robin Thomas:
On the orientable genus of graphs embedded in the klein bottle. 407-419 - Sheng Bau, Derek A. Holton:
Cycles containing 12 vertices in 3-connected cubic graphs. 421-429 - David Hartvigsen, Russell Mardon:
The prism-free planar graphs and their cycles bases. 431-441 - Bill Jackson:
Neighborhood unions and hamilton cycles. 443-451
Volume 15, Number 5, November 1991
- Guo-Hui Zhang:
Smallest regular graphs with prescribed odd girth. 453-467 - Huishan Zhou:
Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs. 469-488 - Huishan Zhou:
Multiplicativity. Part II. Nonmultiplicative digraphs and characterization of oriented paths. 489-509 - Yair Caro:
On zero-sum delta-systems and multiple copies of hypergraphs. 511-521 - Min-Li Yu:
Almost resolvable Pk-decompositions of complete graphs. 523-541 - Maw-Shang Chang, Chuan Yi Tang, Richard C. T. Lee:
20-relative neighborhood graphs are hamiltonian. 543-557 - Guoli Ding:
Covering the edges with consecutive sets. 559-562
Volume 15, Number 6, December 1991
- Mark N. Ellingham:
Vertex-switching, isomorphism, and pseudosimilarity. 563-572 - Michael S. Jacobson, Fred R. McMorris, Edward R. Scheinerman:
General results on tolerance intersection graphs. 573-577 - Paul Erdös, John G. Gimbel, Dieter Kratsch:
Some extremal results in cochromatic and dichromatic theory. 579-585 - László Babai:
Vertex-transitive graphs and vertex-transitive maps. 587-627 - Colin McDiarmid, Luo Xinhua:
Upper bounds for harmonious colorings. 629-636 - Colin McDiarmid:
Expected numbers at hitting times. 637-648 - André Raspaud:
Cycle covers of graphs with a nowhere-zero 4-flow. 649-654 - Atsushi Kaneko, Akira Saito:
Cycles intersecting a prescribed vertex set. 655-664
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-05-10 18:48 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:
