default search action
Graphs and Combinatorics, Volume 17
Volume 17, Number 1, March 2001
- Ahmed Ainouche, Mekkia Kouider:
Cycles in Partially Square Graphs. 1-9 - Noga Alon, Vanessa Teague, Nicholas C. Wormald:
Linear Arboricity and Linear k-Arboricity of Regular Graphs. 11-16 - Bruce L. Bauslaugh:
List-Compactness of Infinite Directed Graphs. 17-38 - Elizabeth J. Billington, Dean G. Hoffman:
Trades and Graphs. 39-54 - Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman:
Star Decompositions of Cubes. 55-59 - Yaojun Chen, Feng Tian, Bing Wei:
Degree Sums and Path-Factors in Graphs. 61-71 - Zoltán Füredi:
Maximal t-Critical Linear Hypergraphs. 73-78 - Khee Meng Koh, Eng Guan Tay:
On Optimal Orientations of Cartesian Products of Trees. 79-97 - Yaakov S. Kupitz, Horst Martini:
From Intersectors to Successors. 99-111 - Aung Kyaw:
A Sufficient Condition for a Graph to Have a k-tree. 113-121 - Yusheng Li, Cecil C. Rousseau, Wenan Zang:
Asymptotic Upper Bounds for Ramsey Functions. 123-128 - Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan:
On Cycle Sequences. 129-133 - Sean McGuinness:
Colouring Arcwise Connected Sets in the Plane II. 135-148 - Arlene A. Pascasio:
Tight Distance-Regular Graphs and the Q-Polynomial Property. 149-169 - Marian Trenkler:
Super-Magic Complete k-Partite Hypergraphs. Graphs Comb. 17(1): 171-175 (2001) - Hong Wang:
On Independent Cycles in a Bipartite Graph. 177-183 - Jerzy Wojdylo:
An Inextensible Association Scheme Associated with a 4-regular Graph. 185-192
Volume 17, Number 2, June 2001
- G. K. Bennett, Mike J. Grannell, Terry S. Griggs:
Bi-Embeddings of Steiner Triple Systems of Order 15. 193-197 - Darryn E. Bryant:
On the Oberwolfach Problem with Two Similar Length Cycles. 199-206 - Mingjang Chen, Gerard J. Chang:
Families of Graphs Closed Under Taking Powers. 207-212 - Hongbing Fan, Yu-Liang Wu, C. K. Wong:
On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks. 213-225 - David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid:
Domination Graphs with Nontrivial Components. 227-236 - Marisa Gutierrez:
Intersection Graphs and the Clique Operator. Graphs Comb. 17(2): 237-244 (2001) - Ervin Györi, Wilfried Imrich:
On the Strong Product of a k-Extendable and an l-Extendable Graph. 245-253 - Jerzy Jaworski, Zbigniew Palka:
Subgraphs of Random Match-Graphs. 255-264 - Leif K. Jørgensen:
Vertex Partitions of K4, 4-Minor Free Graphs. 265-274 - Ákos Kisvölcsey:
Exact Bounds on Cross-Intersecting Families. 275-287 - Marián Klesc:
On the Crossing Numbers of Products of Stars and Graphs of Order Five. 289-294 - Ton Kloks, Dieter Kratsch, Haiko Müller:
On the Structure of Graphs with Bounded Asteroidal Number. 295-306 - Cai Heng Li, Sanming Zhou:
On Isomorphisms of Minimal Cayley Graphs and Digraphs. 307-314 - Barbara M. Maenhaut:
On the Volume of 5-Cycle Trades. 315-328 - Daniel P. Sanders, Yue Zhao:
On Improving the Edge-Face Coloring Theorem. 329-341 - Takao Ueda:
An Enhanced Arimoto Theorem on Threshold Transformations. 343-351 - J. F. Weng:
Steiner Trees on Curved Surfaces. 353-363 - Pou-Lin Wu:
On Large Circuits in Matroids. 365-388
Volume 17, Number 3, September 2001
- Lawrence Brenton, Lynda Jaje:
Perfectly Weighted Graphs. 389-407 - Guantao Chen, Bing Wei, Xuerong Zhang:
Degree-Light-Free Graphs and Hamiltonian Cycles. 409-434 - Celina M. H. de Figueiredo, Frédéric Maffray, Oscar Porto:
On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. 435-456 - H. L. Fu, Christopher A. Rodger:
Four-Cycle Systems with Two-Regular Leaves. 457-461 - Zoltán Füredi, Douglas B. West:
Ramsey Theory and Bandwidth of Graphs. 463-471 - Gregory Z. Gutin, Anders Yeo:
Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. 473-477 - Ryan B. Hayward:
Bull-Free Weakly Chordal Perfectly Orderable Graphs. 479-500 - Mikio Kano, Haruhide Matsuda:
Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. 501-509 - Keiko Kotani:
Factors and Connected Induced Subgraphs. 511-515 - Raffaele Mosca:
A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. 517-528 - Seiya Negami, Atsuhiro Nakamoto:
Triangulations on Closed Surfaces Covered by Vertices of Given Degree. 529-537 - Alex D. Scott:
On Induced Subgraphs with All Degrees Odd. 539-553 - Zhiren Sun, Feng Tian, Bing Wei:
Degree Sums, Connectivity and Dominating Cycles in Graphs. 555-564 - Zhiren Sun, Feng Tian, Bing Wei:
Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. 565-577 - Raphael Yuster:
Large Monotone Paths in Graphs with Bounded Degree. 579-587
Volume 17, Number 4, December 2001
- Etsuko Bannai:
Bose-Mesner Algebras Associated with Four-Weight Spin Models. 589-598 - Gary Chartrand, David Erwin, Michael E. Raines, Ping Zhang:
The Decomposition Dimension of Graphs. 599-605 - Klaus Dohmen:
A Note on Narushima's Principle of Inclusion-Exclusion on Partition Lattices. 607-610 - Feng Ming Dong, Khee Meng Koh, Kee L. Teo:
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. 611-635 - Marcel Erné, Jürgen Reinhold:
Embedding Structures. 637-645 - Zhicheng Gao, Jorge Urrutia, Jianyu Wang:
Diagonal Flips in Labelled Planar Triangulations. 647-657 - Stanislav Jendrol', Peter J. Owens:
On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. 659-680 - Hao Li:
A Generalization of the Gallai-Roy Theorem. 681-685 - Mingchu Li:
Hamiltonian Cycles in Almost Claw-Free Graphs. 687-706 - Hiroshi Nakano:
On a Distance-Regular Graph of Even Height with ke= kf. 707-716 - János Pach, Rephael Wenger:
Embedding Planar Graphs at Fixed Vertex Locations. 717-728 - Oleg Pikhurko:
Uniform Families and Count Matroids. 729-740 - Romeo Rizzi:
Excluding a Simple Good Pair Approach to Directed Cuts. 741-744 - Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed:
Recognizing Planar Strict Quasi-Parity Graphs. 745-757 - Zsolt Tuza, Annegret Wagler:
Minimally Non-Preperfect Graphs of Small Maximum Degree. 759-773 - Liming Xiong:
The Hamiltonian Index of a Graph. 775-784
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.