Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 22
Volume 22, Number 1, May 1996
- Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl:
Ramsey-type results for oriented trees. 1-8 - S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
Domination critical graphs with higher independent domination numbers. 9-14 - Peter Dankelmann, Ortrud R. Oellermann, Henda C. Swart:
The average Steiner distance of a graph. 15-22 - Jinquan Dong:
Some results on graphs without long induced paths. 23-28 - Weifan Wang, Jiazhuang Liu:
On the vertex face total chromatic number of planar graphs. 29-37 - Richard Brunet, R. Bruce Richter, Jozef Sirán:
Covering genus-reducing edges by Kuratowski subgraphs. 39-45 - John P. Georges, David W. Mauro:
On the size of graphs labeled with a condition at distance two. 47-57 - Katsuhiro Ota, Taro Tokuda:
A degree condition for the existence of regular factors in K1, n-free graphs. 59-64 - Yubao Guo:
Strongly Hamiltonian-connected locally semicomplete digraphs. 65-73 - S. Ramachandran, R. Parvathy:
Pancyclicity and extendability in strong products. 75-82 - Ahmed Ainouche:
A short proof of a theorem on Hamiltonian graphs. 83-87 - Eberhard Triesch:
Degree sequences of graphs and dominance order. 89-93
Volume 22, Number 2, June 1996
- Armen S. Asratian, Roland Häggkvist, G. V. Sarkisian:
A characterization of panconnected graphs satisfying a local ore-type condition. 95-103 - Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman:
Hamiltonicity of regular 2-connected graphs. 105-124 - Azaria Paz, Judea Pearl, Shmuel Ur:
A new characterization of graphs based on interception relations. 125-136 - Van H. Vu:
On the embedding of graphs into graphs with few eigenvalues. 137-149 - Paul A. Catlin:
A reduction criterion for supereulerian graphs. 151-153 - Daniel P. Sanders, Yue Zhao:
On d-diagonal colorings. 155-166 - Zbigniew R. Bogdanowicz:
Pancyclicity of connected circulant graphs. 167-174 - Peter Adams, Darryn E. Bryant:
The spectrum problem for the Petersen graph. 175-180 - Jørgen Bang-Jensen, Gregory Z. Gutin, Hao Li:
Sufficient conditions for a digraph to be Hamiltonian. 181-187 - Norbert Polat:
Colorings of infinite graphs without one-colored rays. 189-201
Volume 22, Number 3, July 1996
- Kyriakos Kilakos, F. Bruce Shepherd:
Subdivisions and the chromatic index of r-graphs. 203-212 - Gary MacGillivray, Karen Seyffarth:
Domination numbers of planar graphs. 213-229 - Noga Alon, Colin McDiarmid, Michael Molloy:
Edge-disjoint cycles in regular directed graphs. 231-237 - Marián Klesc, R. Bruce Richter, Ian Stobert:
The crossing number of C5 × Cn. 239-243 - Zsolt Tuza, Margit Voigt:
Every 2-choosable graph is (2m, m)-choosable. 245-252 - Roman Nedela, Martin Skoviera:
Decompositions and reductions of snarks. 253-279
Volume 22, Number 4, August 1996
- M. C. Balbuena, Ángeles Carmona, Miguel Angel Fiol:
Distance connectivity in graphs and digraphs. 281-292 - Paolo Codato, Michele Conforti, Claudia Serafini:
Packing T-joins. 293-296 - Barun K. Sanyal, Malay K. Sen:
New characterizations of digraphs represented by intervals. 297-303 - Tsuyoshi Nishimura:
Component factors and induced subgraphs. 305-308 - Eckhard Steffen:
Tutte's 5-flow conjecture for graphs of nonorientable genus 5. 309-319 - Brendan D. McKay, Cheryl E. Praeger:
Vertex-transitive graphs that are not Cayley graphs. II. 321-334 - Xiaoyun Lu:
On avoidable and unavoidable trees. 335-346 - Hans-Jürgen Bandelt, Gustav Burosch, Jean-Marie Laborde:
Cartesian products of trees and paths. 347-356 - Peter Niemeyer:
On bounded automorphisms of locally finite transitive graphs. 357-365 - C. D. Wakelin:
Chromatic polynomials and σ-polynomials. 367-381
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 19: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:
