Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 31
Volume 31, Number 1, May 1999
- Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
The consecutive-4 digraphs are Hamiltonian. 1-6 - C. Paul Bonnington, Jozef Sirán:
Bipartite labeling of trees with maximum degree three. 7-15 - Daniel A. Marcus:
Directed cycles with chords. 17-28 - Igor E. Zverovich, Vadim E. Zverovich:
A semi-induced subgraph characterization of upper domination perfect graphs. 29-49 - Stefan Hougardy:
On wing-perfect graphs. 51-66 - Daniel P. Sanders, Yue Zhao:
On total 9-coloring planar graphs of maximum degree seven. 67-73
Volume 31, Number 2, June 1999
- Yung-Ling Lai, Kenneth Williams:
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. 75-94 - John Maharry:
An excluded minor theorem for the octahedron. 95-100 - Hong Wang:
On 2-factors of a bipartite graph. 101-106 - Heinz Adolf Jung, P. Wittmann:
Longest cycles in tough graphs. 107-127 - Jian-Liang Wu:
On the linear arboricity of planar graphs. 129-134 - Katherine Heinrich, Jiping Liu, Min-Li Yu:
P4-decompositions of regular graphs. 135-143 - Alon Nilli:
Short odd cycles in 4-chromatic graphs. 145-147 - Bruce A. Reed:
The list colouring constants. 149-153
Volume 31, Number 3, July 1999
- Chính T. Hoàng, Frédéric Maffray, Marc Noy:
A characterization of P4-indifference graphs. 155-162 - Christina M. Mynhardt:
Vertices contained in every minimum dominating set of a tree. 163-177 - Tibor Jordán:
Extremal graphs in connectivity augmentation. 179-193 - Tibor Jordán:
On the number of shredders. 195-200 - Van H. Vu:
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs. 201-226 - Michael Drmota, Bernhard Gittenberger:
The distribution of nodes of given degree in random trees. 227-253 - Lorenz Halbeisen, Norbert Hungerbühler:
Generation of isospectral graphs. 255-265
Volume 31, Number 4, August 1999
- Leonid S. Melnikov, Vadym G. Vizing:
The edge chromatic number of a directed/mixed multigraph. 267-273 - Eldar Fischer:
Variants of the Hajnal-Szemerédi Theorem. 275-282 - Uri N. Peled, Rossella Petreschi, Andrea Sterbini:
(n, e)-Graphs with maximum sum of squares of degrees. 283-295 - Dieter Rautenbach:
A linear vizing-like relation between the size and the domination number of a graph. 297-302 - Michael Molloy:
Chromatic neighborhood sets. 303-311 - Jørgen Bang-Jensen, Yubao Guo:
A note on vertex pancyclic oriented graphs. 313-318 - Steve Bowser, Charles Cable, J. Richard Lundgren:
Niche graphs and mixed pair graphs of tournaments. 319-332 - Hong Wang:
Proof of a conjecture on cycles in a bipartite graph. 333-343 - Joy Morris:
Isomorphic Cayley graphs on nonisomorphic groups. 345-362
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-18 20:21 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:
