default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 42
Volume 42, Number 1, January 2003
- Robert E. Jamison, Tao Jiang, Alan C. H. Ling:
Constrained Ramsey numbers of graphs. 1-16 - Michael Krivelevich, Benny Sudakov:
Sparse pseudo-random graphs are Hamiltonian. 17-33 - Jan Kristian Haugland
:
Classification of certain subgraphs of the 3-dimensional grid. 34-60 - Tomás Feder, Pavol Hell, Jing Huang:
Bi-arc graphs and the complexity of list homomorphisms. 61-80
Volume 42, Number 2, February 2003
- Philippe Pitteloud:
Estimates of coefficients of chromatic polynomials and numbers of cliques of (c, n, m)-graphs. 81-94 - Paul N. Balister, O. M. Riordan, Richard H. Schelp:
Vertex-distinguishing edge colorings of graphs. 95-109 - Jan van den Heuvel, Sean McGuinness:
Coloring the square of a planar graph. 110-124 - Herbert Fleischner, Gert Sabidussi:
3-colorability of 4-regular hamiltonian graphs. 125-140 - David S. Herscovici:
Graham's pebbling conjecture on products of cycles. 141-154 - Manoel Lemos, James G. Oxley:
On removable cycles through every edge. 155-164
Volume 42, Number 3, March 2003
- Brenda J. Latka:
Structure theorem for tournaments omitting N5. 165-192 - Dhruv Mubayi:
Coloring with three-colored subgraphs. 193-198 - Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. 199-210 - Hong-Jian Lai:
Nowhere-zero 3-flows in locally connected graphs. 211-219 - Oleg Pikhurko:
Size ramsey numbers of stars versus 4-chromatic graphs. 220-233 - Lutz Volkmann:
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number. 234-245 - Mathew Cropper, András Gyárfás, Jenö Lehel:
Edge list multicoloring trees: An extension of Hall's theorem. 246-255
Volume 42, Number 4, April 2003
- C. Paul Bonnington, Mark E. Watkins:
Planar embeddings with infinite faces. 257-275 - Yoshiyasu Ishigami, Tao Jiang:
Vertex-disjoint cycles containing prescribed vertices. 276-296 - Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo:
Small degree out-branchings. 297-307 - Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao:
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. 308-319 - Lowell Abrams, Daniel C. Slilaty:
An algebraic characterization of projective-planar graphs. 320-331 - Benny Pinontoan, R. Bruce Richter:
Crossing numbers of sequences of graphs II: Planar tiles. 332-341 - Henning Bruhn:
Generating cycles in graphs with at most one end. 342-349 - Marston D. E. Conder, Margaret Morton, Cheryl E. Praeger:
Two-arc closed subsets of graphs. 350-364
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-11-04 20:45 CET 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:
