default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 28
Volume 28, Number 1, May 1998
- Martin Kochol:
Hypothetical complexity of the nowhere-zero 5-flow problem. 1-11 - William Klostermeyer, Lubomír Soltés:
Hamiltonicity and reversing arcs in digraphs. 13-30 - Garth Isaak:
Powers of Hamiltonian paths in interval graphs. 31-38 - Robert Johansson
:
An El-Zahár type condition ensuring path-factors. 39-42 - András Gyárfáas:
Nonsymmetric party problems. 43-47 - Michael A. Henning, Hugh R. Hind:
Strict majority functions on graphs. 49-56
Volume 28, Number 2, June 1998
- Alberto Cavicchioli, Mauro Meschiari, Beatrice Ruini, Fulvia Spaggiari:
A survey on snarks and new results: Products, reducibility and a computer search. 57-86 - Zhenhong Liu, Baoguang Xu:
On low bound of degree sequences of spanning trees in K-edge-connected graphs. 87-95 - Odile Favaron:
Irredundance in inflated graphs. 97-104 - Guoli Ding:
Chordal graphs, interval graphs, and wqo. 105-114
Volume 28, Number 3, July 1998
- Owen D. Byer:
Some new bounds for the maximum number of vertex colorings of a (v, e)-graph. 115-128 - Stefan Felsner:
Tolerance graphs, and orders. 129-140 - Guantao Chen, Xiaoyun Lu, Douglas B. West:
Star-factors of tournaments. 141-145 - Claudson F. Bornstein, Jayme Luiz Szwarcfiter:
Iterated clique graphs with increasing diameters. 147-154 - Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang:
On (k, d)-colorings and fractional nowhere-zero flows. 155-161 - Gelasio Salazar:
On the crossing number of cm × cn. 163-170
Volume 28, Number 4, August 1998
- Jørgen Bang-Jensen, Gregory Z. Gutin:
Generalizations of tournaments: A survey. 171-202 - Jinjiang Yuan:
Induced matching extendable graphs. 203-213 - Stewart Neufeld, Jian Shen:
Some results on generalized exponents. 215-225
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 2026-08-25 22:07 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
