Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 24
Volume 24, Number 1, January 1997
- Martin Knor, Jozef Sirán:
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface. 1-8 - Tomás Dvorák
, Ivan Havel, Jean-Marie Laborde, Michel Mollard:
Spanning caterpillars of a hypercube. 9-19 - Roger C. Entringer, Wayne Goddard, Michael A. Henning:
A note on cliques and independent sets. 21-23 - Stefan Hougardy, Van Bang Le, Annegret Wagler:
Wing-triangulated graphs are perfect. 25-31 - David Moser:
The star-chromatic number of planar graphs. 33-43 - Lenhard L. Ng, Michelle Schultz:
k-ordered Hamiltonian graphs. 45-57 - Guantao Chen, Richard H. Schelp, Lubomír Soltés:
Special monochromatic trees in two-colored complete graphs. 59-67 - Guantao Chen, Richard H. Schelp, Lubomír Soltés:
Graphs with given odd sets. 69-80 - S. Louis Hakimi:
Graphs with given odd sets and the least number of vertices. 81-83 - Stephen Mellendorf:
Hamilton decompositions of cartesian products of multicycles. 85-115
Volume 24, Number 2, February 1997
- Jeong Han Kim, Prasad Tetali, Peter C. Fishburn:
Score certificates for tournaments. 117-138 - Vojtech Rödl, Beata Wysocka:
Note on regular subgraphs. 139-154 - Hikoe Enomoto, Shinsuke Matsunaga:
Graph decompositions without isolated vertices III. 155-164 - Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. 165-173 - Anders Yeo:
One-diregular subgraphs in semicomplete multipartite digraphs. 175-185 - Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger:
Connectivity of cages. 187-191 - Randy Shull, Ann N. Trenk:
Unit and proper bitolerance digraphs. 193-199
Volume 24, Number 3, March 1997
- Richard H. Schelp:
Local and mean k-Ramsey numbers for complete graphs. 201-203 - Lenore Cowen, Wayne Goddard, C. Esther Jesurum:
Defective coloring revisited. 205-219 - Odile Favaron, Christina M. Mynhardt:
On equality in an upper bound for domination parameters of graphs. 221-231 - Margit Voigt, Brunhilde Wirth:
On 3-colorable non-4-choosable planar graphs. 233-235 - Gregory L. Cherlin, Niandong Shi:
Graphs omitting sums of complete graphs. 237-247 - Gert Sabidussi:
Parity equivalence in eulerian graphs. 249-256 - Christos A. Athanasiadis:
Iterating the branching operation on a directed graph. 257-265 - Jennifer J. Quinn, Arthur T. Benjamin:
Strong chromatic index of subset graphs. 267-273 - Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota:
Long cycles passing through a specified edge in a 3-connected graph. 275-279 - Bojan Mohar:
On the minimal genus of 2-complexes. 281-290
Volume 24, Number 4, April 1997
- Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis:
Extensions of some factorization results from simple graphs to multigraphs. 291-295 - Alex D. Scott:
Induced trees in graphs of large chromatic number. 297-311 - Bo Yu:
Convexity of minimal total dominating functions in graphs. 313-321 - Carsten Flotow:
Graphs whose powers are chordal and graphs whose powers are interval graphs. 323-330 - Alexandr V. Kostochka, Éric Sopena, Xuding Zhu:
Acyclic and oriented chromatic numbers of graphs. 331-340 - Daniel P. Sanders:
On paths in planar graphs. 341-345 - K. H. Chew:
An extension of Vizing's theorem. 347-355 - Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti:
A characterization of Seymour graphs. 357-364
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-17 20:32 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:
