Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 40
Volume 40, Number 1, May 2002
- Wayne Goddard, Michael A. Henning:
Domination in planar graphs with small diameter. 1-25 - Alexandr V. Kostochka, Douglas R. Woodall:
Total choosability of multicircuits I. 26-43 - Alexandr V. Kostochka, Douglas R. Woodall:
Total choosability of multicircuits II. 44-67 - André Kündgen
, Michael Molloy:
Extremal problems for chromatic neighborhood sets. 68-74
Volume 40, Number 2, June 2002
- Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-extendable graphs. 75-82 - Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Éric Sopena:
Acyclic list 7-coloring of planar graphs. 83-90 - Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski:
Tiled partial cubes. 91-103 - Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman:
Forbidden subgraphs that imply hamiltonian-connectedness. 104-119 - Noga Alon, Paul Erdös, David S. Gunderson, Michael Molloy:
A Ramsey-type problem and the Turán numbers. 120-129 - Kyoji Ohba:
On chromatic-choosable graphs. 130-135
Volume 40, Number 3, July 2002
- Martin Kochol:
Tension polynomials of graphs. 137-146 - Cun-Quan Zhang:
Circular flows of nearly Eulerian graphs and vertex-splitting. 147-161 - Benoît Larose, Claude Tardif:
Projectivity and independent sets in powers of graphs. 162-171 - Alfredo García Olaverri, M. Carmen Hernando, Ferran Hurtado, Marc Noy, Javier Tejel:
Packing trees into planar graphs. 172-181 - Jørgen Bang-Jensen, Jing Huang:
Convex-round graphs are circular-perfect. 182-194
Volume 40, Number 4, August 2002
- Zoltán Füredi, André Kündgen:
Turán problems for integer-weighted graphs. 195-225 - Zoltán Füredi, Radhika Ramamurthi:
On splittable colorings of graphs and hypergraphs. 226-237 - Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vuskovic:
Even-hole-free graphs part II: Recognition algorithm. 238-266 - Haodi Feng, Guizhen Liu:
Orthogonal factorizations of graphs. 267-276
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-19 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:
