default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 21
Volume 21, Number 1, January 1996
- Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
On graphs satisfying a local ore-type condition. 1-10 - Toru Hasunuma, Yukio Shibata:
The number of labeled graphs placeable by a given permutation. 11-19 - Noga Alon, Michael R. Fellows, Donovan R. Hare:
Vertex transversals that dominate. 21-31 - Hortensia Galeana-Sánchez:
On claw-free M-oriented critical kernel-imperfect digraphs. 33-39 - Toru Hasunuma, Yukio Shibata:
Remarks on the placeability of isomorphic trees in a complete graph. 41-42 - Daniel P. Sanders:
On Hamilton cycles in certain planar graphs. 43-50 - R. Bruce Richter, Jozef Sirán:
The crossing number of K3, n in a surface. 51-54 - András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray:
Minimal non-neighborhood-perfect graphs. 55-66 - Ryan Hayward:
Generating weakly triangulated graphs. 67-69 - Hong Wang, Norbert Sauer:
Packing of three copies of a graph. 71-80 - Xueliang Li:
Isomorphisms of P3-graphs. 81-85 - Jan van den Heuvel:
Long cycles in graphs with large degree sums and neighborhood unions. 87-102 - Guantao Chen, Wiktor Piotrowski, Warren E. Shreve:
A partition approach to Vizing's conjecture. 103-111
Volume 21, Number 2, February 1996
- Erich Prisner, Jerzy Topp, Preben D. Vestergaard:
Well covered simplicial, chordal, and circular arc graphs. 113-119 - Yubao Guo, Lutz Volkmann:
Locally semicomplete digraphs that are complementary m-pancyclic. 121-136 - Hans Jürgen Prömel, Angelika Steger:
On the asymptotic structure of sparse triangle free graphs. 137-151 - Yannis Manoussakis, Michael Spyratos, Zsolt Tuza:
Cycles of given color patterns. 153-162 - Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann:
Weakly Hamiltonian-connected locally semicomplete digraphs. 163-172 - B. A. Cox, C. A. Rodger:
Cycle systems of the line graph of the complete graph. 173-182 - Oleg V. Borodin:
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. 183-186 - Katherine Heinrich, P. Horak, Walter D. Wallis, Qinglin Yu:
Perfect double covers with paths of length four. 187-197 - Marisa Gutierrez, Lía Oubiña:
Metric characterizations of proper interval graphs and tree-clique graphs. 199-205 - Saul Stahl:
Note on the nth chromatic numbers of the Grötzsch graph. 207-209 - Qingyan Du:
On σ-equivalence and χ-equivalence of graphs. 211-217 - D. A. Youngs:
4-chromatic projective graphs. 219-227 - Mariusz Wozniak:
On the Erdös-Sós conjecture. 229-234 - George Steiner:
The recognition of indifference digraphs and generalized semiorders. 235-241 - Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito:
Essential independent sets and Hamiltonian cycles. 243-249
Volume 21, Number 3, March 1996
- Lih-Hsing Hsu:
A classification of graph capacity functions. 251-265 - Leizhen Cai, Derek G. Corneil, Andrzej Proskurowski:
A generalization of line graphs: (X, Y)-intersection graphs. 267-287 - Atsuhiro Nakamoto:
Diagonal transformations in quadrangulations of surfaces. 289-299 - Jennifer Keir, R. Bruce Richter:
Walks through every edge exactly twice II. 301-309 - Klaus Dohmen:
On graph invariants satisfying the deletion-contraction formula. 311-316 - Daniel P. Sanders:
On the effect of major vertices on the number of light edges. 317-322 - John Mackey:
A lower bound for groupies in graphs. 323-326 - Lawrence Wargo:
Regular matroids with every circuit basis fundamental. 327-334 - Daniel P. Sanders:
On light edges and triangles in projective planar graphs. 335-342 - Chris Jagger:
An extremal function for digraph subcontraction. 343-350 - Gregory L. Cherlin, Niandong Shi:
Graphs omitting a finite set of cycles. 351-355
Volume 21, Number 4, April 1996
- Odile Favaron, Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Zhengsheng Wu:
Sequences, claws and cyclability of graphs. 357-369 - Wolfgang Mader:
On topological tournaments of order 4 in digraphs of outdegree 3. 371-376 - Nancy Eaton, Ronald J. Gould, Vojtech Rödl:
On p-intersection representations. 377-392 - David A. Gregory, Kevin N. Vander Meulen:
Sharp bounds for decompositions of graphs into complete r-partite subgraphs. 393-400 - Cun-Quan Zhang:
On embeddings of graphs containing no K5-minor. 401-404 - Douglas Bauer, Jan van den Heuvel, Edward F. Schmeichel:
2-factors in triangle-free graphs. 405-412 - Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o:
The book crossing number of a graph. 413-424 - Lisa R. Markus, Hunter S. Snevily:
Disjoint cycles in star-free graphs. 425-430 - Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Toughness and hamiltonicity in almost claw-free graphs. 431-439 - Raphael Yuster:
The number of edge colorings with no monochromatic triangle. 441-452
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:
